Two-Timescale Optimization Framework for Sparse-Feedback Linear-Quadratic Optimal Control
Abstract
A -guaranteed sparse-feedback linear-quadratic (LQ) optimal control with convex parameterization and convex-bounded uncertainty is studied in this paper, where -penalty is added into the cost to penalize the number of communication links among distributed controllers. Then, the sparse-feedback gain is investigated to minimize the modified cost together with the stability guarantee, and the corresponding main results are of three parts. First, the 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 -penalty is directly studied through BSUM (Block Successive Upper-bound Minimization) framework, and precise approximation method and variational properties are introduced.
Cite
@article{arxiv.2406.11168,
title = {Two-Timescale Optimization Framework for Sparse-Feedback Linear-Quadratic Optimal Control},
author = {Lechen Feng and Yuan-Hua Ni and Xuebo Zhang},
journal= {arXiv preprint arXiv:2406.11168},
year = {2024}
}