A single-trajectory model-free inverse LQR method is reformulated as a convex conic feasibility problem and solved by BSUM with an O(1/k) sublinear convergence rate claim.
Two-Timescale Optimization Framework for Sparse-Feedback Linear-Quadratic Optimal Control
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
A $\mathcal{H}_2$-guaranteed sparse-feedback linear-quadratic (LQ) optimal control with convex parameterization and convex-bounded uncertainty is studied in this paper, where $\ell_0$-penalty is added into the $\mathcal{H}_2$ cost to penalize the number of communication links among distributed controllers. Then, the sparse-feedback gain is investigated to minimize the modified $\mathcal{H}_2$ cost together with the stability guarantee, and the corresponding main results are of three parts. First, the $\ell_1$ relaxation sparse-feedback LQ problem is of concern, and a two-timescale algorithm is developed based on proximal coordinate descent and primal-dual splitting approach. Second, piecewise quadratic relaxation sparse-feedback LQ control is investigated, which exhibits an accelerated convergence rate. Third, sparse-feedback LQ problem with $\ell_0$-penalty is directly studied through BSUM (Block Successive Upper-bound Minimization) framework, and precise approximation method and variational properties are introduced.
citation-role summary
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Convex Optimization Approach to Model-Free Inverse Optimal Control with Provable Convergence
A single-trajectory model-free inverse LQR method is reformulated as a convex conic feasibility problem and solved by BSUM with an O(1/k) sublinear convergence rate claim.