The projective method for solving linear matrix inequalities
Arkadi S. Nemirovski, Pascal M. Gahinet · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · 2005
In many control problems, the design constraints have natural formulations in terms of linear matrix inequalities (LMI). When no analytical solution is available, such problems can be attacked by solving the LMIs via convex optimization techniques. This paper describes the polynomial-time projective algorithm for the numerical solution of LMIs. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the projective method. A complexity analysis is provided, and applications to two generic LMI problems are discussed.
Cited by 176 works. doi:10.1109/acc.1994.751861
Authors
References
- A new polynomial-time algorithm for linear programming
- State-space solutions to standard H/sub 2/ and H/sub infinity / control problems
- A linear matrix inequality approach to H ∞ control
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Method of centers for minimizing generalized eigenvalues
- Large-Scale Optimization of Eigenvalues
- A primal—dual potential reduction method for problems involving matrix inequalities
- An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
- Interior Point Methods for the Monotone Linear Complementarity Problem in Symmetric Matrices
- General-Purpose LMI solvers with benchmarks