Majorization: a computational complexity reduction technique in control system design

DOI10.1109/9.14413MaRDI QIDQ3813684zbMATH OpenOpenAlexFDO

Authors Elijah Polak, Daniel M. Stimler

Publication date 1988

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.14413

zbMATH Keywords

computational complexity reductionnondifferentiable optimizationoptimal worst control system designSemi-infinite programming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semi-infinite programming (90C34) Synthesis problems (93B50)

Recommendations

• Computational complexity reduction in scaled \({\mathcal H}_ \infty\) synthesis
• Controller design for plants with structured uncertainty
• Computational complexity in robust controller synthesis
• Some computational results on size reduction in H/sup infinity / design
• scientific article; zbMATH DE number 653039

Cited in

(2)

• Alternative algorithms for solving nonlinear function and functional inequalities
• A provable semi-infinite programming approach for solving constrained dynamic games

This page was built for publication: Majorization: a computational complexity reduction technique in control system design

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