A convex penalty for switching control of partial differential equations
arXiv:1702.07505 · doi:10.1016/j.sysconle.2015.12.013
Abstract
A convex penalty for promoting switching controls for partial differential equations is introduced; such controls consist of an arbitrary number of components of which at most one should be simultaneously active. Using a Moreau-Yosida approximation, a family of approximating problems is obtained that is amenable to solution by a semismooth Newton method. The efficiency of this approach and the structure of the obtained controls are demonstrated by numerical examples.
References in corpus (2)
Cited by in corpus (7)
- Nonconvex penalization of switching control of partial differential equations
- Optimal control problems with control complementarity constraints
- Sparse and Switching Infinite Horizon Optimal Control with Mixed-Norm Penalizations
- Stability of saddle points via explicit coderivatives of pointwise subdifferentials
- Parabolic optimal control problems with combinatorial switching constraints -- Part I: Convex relaxations
- Reinforcement learning for linear-convex models with jumps via stability analysis of feedback controls
- L1 penalization of volumetric dose objectives in optimal control of PDEs