Computational complexity in robust controller synthesis

DOI10.1007/BFB0109721zbMATH Open0924.93010OpenAlexW2097638353MaRDI QIDQ4227146FDOQ4227146

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

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

zbMATH Keywords

computational complexitynonconvex programsrobust control synthesismatrix product eigenvalue problem

Mathematics Subject Classification ID

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

Cited In (5)

• A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices
• Global optimization for robust control synthesis based on the matrix product eigenvalue problem
• Robustness of a minimal controller synthesis algorithm
• Title not available (Why is that?)
• Majorization: a computational complexity reduction technique in control system design

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)