Computational complexity reduction in scaled \({\mathcal H}_ \infty\) synthesis

DOI10.1016/S0005-1098(97)00045-9zbMath0888.93019OpenAlexW1964915442MaRDI QIDQ1367185

Shinji Hara, Mario A. Rotea, Tetsuya Iwasaki

Publication date: 9 November 1997

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0005-1098(97)00045-9

zbMATH Keywords

linear matrix inequalitiesrobust control designnonconvex constraints

Mathematics Subject Classification ID

Linear inequalities of matrices (15A39) (H^infty)-control (93B36) Linear systems in control theory (93C05)

Cites Work

• Optimal, constant I/O similarity scaling for full-information and state- feedback control problems
• Several NP-hard problems arising in robust stability analysis
• The rank one mixed \(\mu\) problem and `Kharitonov-type' analysis
• Necessary and sufficient conditions of stability: a multiloop generalization of the circle criterion
• Characterization and efficient computation of the structured singular value
• Robust stability with time-varying structured uncertainty
• A convex parameterization of robustly stabilizing controllers
• Linear Matrix Inequalities in System and Control Theory