Sparse and switching infinite horizon optimal controls with mixed-norm penalizations
DOI10.1051/cocv/2019038zbMath1454.49004arXiv1808.10659OpenAlexW2960699114WikidataQ127729739 ScholiaQ127729739MaRDI QIDQ5126404
Karl Kunisch, Dante Kalise, Zhiping Rao
Publication date: 16 October 2020
Published in: ESAIM: Control, Optimisation and Calculus of Variations (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.10659
optimal controldynamic programmingoptimality conditionssparse controlsinfinite horizon controlswitching controlstime-continuous problemtime-discretized approximation
Dynamic programming in optimal control and differential games (49L20) Numerical methods based on necessary conditions (49M05) Nonsmooth analysis (49J52) Dynamic programming (90C39) Existence theories for optimal control problems involving ordinary differential equations (49J15) Optimality conditions for problems involving ordinary differential equations (49K15)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- A convex penalty for switching control of partial differential equations
- Relaxation methods for mixed-integer optimal control of partial differential equations
- Systems governed by ordinary differential equations with continuous, switching and impulse controls
- Switching control
- Semiconcave functions, Hamilton-Jacobi equations, and optimal control
- Sparse regression using mixed norms
- The composite absolute penalties family for grouped and hierarchical variable selection
- \(L_1\)-optimization in linear systems with bounded controls
- Nonconvex penalization of switching control of partial differential equations
- Modeling and analysis of modal switching in networked transport systems
- Infinite horizon sparse optimal control
- A convex analysis approach to optimal controls with switching structure for partial differential equations
- Local Minimization Algorithms for Dynamic Programming Equations
- A Priori Error Analysis for Discretization of Sparse Elliptic Optimal Control Problems in Measure Space
- Directional Sparsity in Optimal Control of Partial Differential Equations
- Approximation of Elliptic Control Problems in Measure Spaces with Sparse Solutions
- An Efficient Policy Iteration Algorithm for Dynamic Programming Equations
- Linear-quadratic control problems withL1-control cost
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Necessary Conditions for Optimal Control Problems with Infinite Horizons
- Sparse Reconstruction by Separable Approximation
- A variational approach to sparsity optimization based on Lagrange multiplier theory
- An iterative algorithm for nonlinear inverse problems with joint sparsity constraints in vector-valued regimes and an application to color image inpainting
- Optimal control
- Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
- Structured sparsity through convex optimization
This page was built for publication: Sparse and switching infinite horizon optimal controls with mixed-norm penalizations