Computational complexity in robust controller synthesis

DOI10.1007/BFB0109721MaRDI QIDQ4227146zbMATH OpenOpenAlexFDO

Authors Yuji Yamada, Shinji Hara

Publication date 23 February 1999

Published in Learning, control and hybrid systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0109721

zbMATH Keywords

computational complexitymatrix product eigenvalue problemnonconvex programsrobust control synthesis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sensitivity (robustness) (93B35) Synthesis problems (93B50) Eigenvalue problems (93B60)

Recommendations

• Global optimization for robust control synthesis based on the matrix product eigenvalue problem
• Computational complexity reduction in scaled \({\mathcal H}_ \infty\) synthesis
• Probabilistic search algorithms for robust stability analysis and their complexity properties

Cited in

(7)

• Computational complexity of a problem arising in fixed order output feedback design
• Global optimization for robust control synthesis based on the matrix product eigenvalue problem
• Robustness of a minimal controller synthesis algorithm
• Majorization: a computational complexity reduction technique in control system design
• scientific article; zbMATH DE number 1343490 (Why is no real title available?)
• Robust controller synthesis via non-linear matrix inequalities
• A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices

This page was built for publication: Computational complexity in robust controller synthesis

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