Smoothing gradient method for group-structured sparse feedback stabilization

From MaRDI portal





The problem of structured sparse feedback stabilization for linear systems is studied. The proposed approach focuses on minimizing the number of nonzero rows and columns in the feedback gain matrix, effectively reducing both the number of control inputs and the number of involved state variables. A weighted matrix norm is introduced to evaluate the sparsity of the gain matrix's rows and columns. Using the state transition matrix of the system, the group sparse feedback stabilization problem is reformulated as an optimization problem with a convex penalty. To solve this problem, a smoothing gradient algorithm is proposed. It is shown that both the performance of the state transition matrix and its gradient can be computed by solving two Lyapunov equations. Furthermore, the smoothing gradient algorithm is proven to converge under a smooth approximation of the matrix norm penalty.



Cites work









This page was built for publication: Smoothing gradient method for group-structured sparse feedback stabilization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6959400)