Greedy optimal control for elliptic problems and its application to turnpike problems

Hernandez-Santamaria V, Lazar M, Zuazua E (2019)


Publication Type: Journal article

Publication year: 2019

Journal

Book Volume: 141

Pages Range: 455-493

Journal Issue: 2

DOI: 10.1007/s00211-018-1005-z

Abstract

We adapt and apply greedy methods to approximate in an efficient way the optimal controls for parameterized elliptic control problems. Our results yield an optimal approximation procedure that, in particular, performs better than simply sampling the parameter-space to compute controls for each parameter value. The same method can be adapted for parabolic control problems, but this leads to greedy selections of the realizations of the parameters that depend on the initial datum under consideration. The turnpike property (which ensures that parabolic optimal control problems behave nearly in a static manner when the control horizon is long enough) allows using the elliptic greedy choice of the parameters in the parabolic setting too. We present various numerical experiments and an extensive discussion of the efficiency of our methodology for parabolic control and indicate a number of open problems arising when analyzing the convergence of the proposed algorithms.

Authors with CRIS profile

Involved external institutions

How to cite

APA:

Hernandez-Santamaria, V., Lazar, M., & Zuazua, E. (2019). Greedy optimal control for elliptic problems and its application to turnpike problems. Numerische Mathematik, 141(2), 455-493. https://dx.doi.org/10.1007/s00211-018-1005-z

MLA:

Hernandez-Santamaria, Victor, Martin Lazar, and Enrique Zuazua. "Greedy optimal control for elliptic problems and its application to turnpike problems." Numerische Mathematik 141.2 (2019): 455-493.

BibTeX: Download