Nonconvex spectral algorithm for solving BMI on the reduced order H<inf>∞</inf> control

Publication Type:
Conference Proceeding
Citation:
Proceedings - 6th IEEE International Conference on Control System, Computing and Engineering, ICCSCE 2016, 2017, pp. 316 - 319
Issue Date:
2017-04-05
Full metadata record
Files in This Item:
Filename Description Size
Nonconvex-Spectral-Shi (1).pdfAccepted Manuscript265.5 kB
Adobe PDF
© 2016 IEEE. The design of reduced-order H ∞ control can be transformed into an optimization problem with bilinear matrix inequality (BMI) constraints, which is an NP-hard problem. We propose a method to equivalently transfer the BMI constraint into a convex LMI constraint plus a matrix-rank constraint. The optimization with matrix-rank constraint is iteratively solved by a sequence of semidefinite programming (SDP) problems. Simulations on several benchmark systems show that our algorithm is practical and efficient.
Please use this identifier to cite or link to this item: