2000 character limit reached
Infinite horizon sparse optimal control
Published 29 Feb 2016 in math.OC | (1602.08931v1)
Abstract: A class of infinite horizon optimal control problems involving $Lp$-type cost functionals with $0<p\leq 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 $Lp$-type penalties is analyzed. A dynamic programming approach is proposed to numerically approximate the corresponding sparse optimal controllers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.