Be greedy and learn: efficient and certified algorithms for parametrized optimal control problems
ESAIM: M2AN, 59 1 (2025) 291-330
Published online: 2025-01-08
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Deep orthogonal decomposition: a continuously adaptive neural network approach to model order reduction of parametrized partial differential equations
Nicola Rares Franco, Andrea Manzoni, Paolo Zunino and Jan S. HesthavenAdvances in Computational Mathematics 52 (3) (2026)
https://doi.org/10.1007/s10444-026-10295-7
Multi-fidelity learning of reduced order models for parabolic PDE constrained optimization
Benedikt Klein and Mario OhlbergerAdvances in Computational Mathematics 52 (2) (2026)
https://doi.org/10.1007/s10444-026-10296-6
Be greedy and learn: efficient and certified algorithms for parametrized optimal control problems
Hendrik Kleikamp, Martin Lazar and Cesare MolinariESAIM: Mathematical Modelling and Numerical Analysis 59 (1) 291 (2025)
https://doi.org/10.1051/m2an/2024074
Two-Stage Model Reduction Approaches for the Efficient and Certified Solution of Parametrized Optimal Control Problems
Hendrik Kleikamp and Lukas ReneltJournal of Scientific Computing 104 (3) (2025)
https://doi.org/10.1007/s10915-025-02988-w