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

Authors:
Preprint
Publisher website
Google Scholar
  • 21 May 2018
    • preprint
    • Published by HAL in HAL
Abstract
5 In this paper, we deal with the approximation of optimal controls for parameter-dependent elliptic and 6 parabolic equations. We adapt well-known results on greedy algorithms to approximate in an efficient 7 way the optimal controls for parameterized elliptic control problems. Our results yield an optimal 8 approximation procedure that, in particular, performs better than simply sampling the parameter-space 9 to compute controls for each parameter value. The same method can be adapted for parabolic control 10 problems, but this leads to greedy selections of the realizations of the parameters that depend on the 11 initial datum under consideration. To avoid this difficulty we employ the turnpike property for time 12 evolution control problems that ensures the asymptotic simplification of optimal control problems for 13 evolution equations towards the elliptic steady-state ones in long time horizons [0, T ]. The combination 14 of the turnpike property and greedy methods allows us to develop efficient methods for the approximation 15 of the parameter-dependent parabolic optimals too. We present various numerical experiments discussing 16 the efficiency of our methodology and its application to turnpike control problems. 17

This publication has 28 references indexed in Scilit: