Back to Search
Start Over
Regularization and discretization error estimates for optimal control of ODEs with group sparsity
- Source :
- ESAIM: Control, Optimisation and Calculus of Variations. 24:811-834
- Publication Year :
- 2018
- Publisher :
- EDP Sciences, 2018.
-
Abstract
- It is well known that optimal control problems with L1-control costs produce sparse solutions, i.e., the optimal control is zero on whole intervals. In this paper, we study a general class of convex linear-quadratic optimal control problems with a sparsity functional that promotes a so-called group sparsity structure of the optimal controls. In this case, the components of the control function take the value of zero on parts of the time interval, simultaneously. These problems are both theoretically interesting and practically relevant. After obtaining results about the structure of the optimal controls, we derive stability estimates for the solution of the problem w.r.t. perturbations and L2-regularization. These results are consequently applied to prove convergence of the Euler discretization. Finally, the usefulness of our approach is demonstrated by solving an illustrative example using a semismooth Newton method.
- Subjects :
- 0209 industrial biotechnology
Mathematical optimization
021103 operations research
Control and Optimization
Euler discretization
Computer Science::Information Retrieval
0211 other engineering and technologies
Ode
Regular polygon
02 engineering and technology
Optimal control
Discretization error
Regularization (mathematics)
Control function
Computational Mathematics
symbols.namesake
020901 industrial engineering & automation
Control and Systems Engineering
symbols
Newton's method
Mathematics
Subjects
Details
- ISSN :
- 12623377 and 12928119
- Volume :
- 24
- Database :
- OpenAIRE
- Journal :
- ESAIM: Control, Optimisation and Calculus of Variations
- Accession number :
- edsair.doi...........a25481279d6886b8595fcde7819c6198