2016
DOI: 10.1007/s10957-016-1016-9
|View full text |Cite
|
Sign up to set email alerts
|

Infinite Horizon Sparse Optimal Control

Abstract: A class of infinite horizon optimal control problems involving L p -type cost functionals with 0 < p ≤ 1 is discussed. The existence of optimal controls is studied for both the convex case with p = 1 and the nonconvex case with 0 < p < 1, and the sparsity structure of the optimal controls promoted by the L p -type penalties is analyzed. A dynamic programming approach is proposed to numerically approximate the corresponding sparse optimal controllers.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
6
1

Relationship

4
3

Authors

Journals

citations
Cited by 19 publications
(18 citation statements)
references
References 23 publications
0
18
0
Order By: Relevance
“…Proof. The case q = p has been dealt with in [21]. Therefore, we focus on the case q > p. Let w n = (w n 1 , .…”
Section: Optimal Control Problemmentioning
confidence: 99%
See 2 more Smart Citations
“…Proof. The case q = p has been dealt with in [21]. Therefore, we focus on the case q > p. Let w n = (w n 1 , .…”
Section: Optimal Control Problemmentioning
confidence: 99%
“…They are either active, or zero and thus they join the set of sparse control coordinates. Comparing to the case p = q which was treated in [21,Proposition 5.2], the case (iii) is such that the control is necessarily active. Thus p < q enhances additional sparsity compared to p = q.…”
Section: Sparsity and Switching Properties: The Time-continuous Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…On the other hand, there is very little research dealing with infinite horizon nonsmmoth problems, see e.g., [18,35]. In [35] infinite horizon sparse optimal control problems governed by ordinary differential equations are investigated. In this work, the corresponding sparse optimal controller is approximated by a dynamic programming approach.…”
Section: Introductionmentioning
confidence: 99%
“…The occurrence of sparse controls in this kind of minimization problems is well known also in the framework of infinite-dimensional optimal control, see for instance [7,8,9], where usually the absolute value of the control is added to the integral cost, in order to induce sparse solutions.…”
Section: Introductionmentioning
confidence: 99%