Global optimization for robust control synthesis based on the Matrix Product Eigenvalue Problem
DOI10.1002/rnc.581zbMath1030.93014OpenAlexW2133744385MaRDI QIDQ2755397
Publication date: 23 February 2004
Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rnc.581
computational complexityglobal optimizationlinear matrix inequalitybilinear matrix inequalitynon-convex optimizationmaximum eigenvaluesuboptimal solutionblock-diagonal matricesmatrix product eigenvalue problemrobost control synthesis
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- A parametric successive underestimation method for convex multiplicative programming problems
- Linear multiplicative programming
- Cubature formulae of high trigonometric accuracy for periodic functions of four variables
- Gain scheduling via linear fractional transformations
- All controllers for the general \({\mathcal H}_ \infty\) control problem: LMI existence conditions and state space formulas
- Optimization on low rank nonconvex structures
- Necessary and sufficient conditions of stability: a multiloop generalization of the circle criterion
- Computational complexity in robust controller synthesis
- Computational complexity of μ calculation
- Robust stability with time-varying structured uncertainty
- Linear Matrix Inequalities in System and Control Theory
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- A cone complementarity linearization algorithm for static output-feedback and related problems
- Global optimization for H/sub ∞/ control with constant diagonal scaling
- TheXY-centring algorithm for the dual LMI problem: a new approach to fixed-order control design
- Semidefinite Programming
This page was built for publication: Global optimization for robust control synthesis based on the Matrix Product Eigenvalue Problem
