Results 1 
3 of
3
Control system analysis and synthesis via linear matrix inequalities
 Control Conference, American
, 1982
"... A wide variety of problems in systems and control theory can be cast or recast as convex problems that involve linear matrix inequalities (LMIs). For a few very special cases there are \analytical solutions " to these problems, but in general they can be solved numerically very e ciently. In ma ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
(Show Context)
A wide variety of problems in systems and control theory can be cast or recast as convex problems that involve linear matrix inequalities (LMIs). For a few very special cases there are \analytical solutions " to these problems, but in general they can be solved numerically very e ciently. In many cases the inequalities have the form of simultaneous Lyapunov or algebraic Riccati inequalities; such problems can be solved in a time that is comparable to the time required to solve the same number of Lyapunov or Algebraic Riccati equations. Therefore the computational cost of extending current control theory that is based on the solution of algebraic Riccati equations to a theory based on the solution of (multiple, simultaneous) Lyapunov or Riccati inequalities is modest. Examples include: multicriterion LQG, synthesis of linear state feedback for multiple or nonlinear plants (\multimodel control"), optimal transfer matrix realization, norm scaling, synthesis of multipliers for Popovlike analysis of systems with unknown gains, and many others. Full details can be found in the references cited. 1.
On maximizing a robustness measure for structured nonlinear perturbations
 Proceedings of the 1992 American Control Conference
, 1992
"... ..."
(Show Context)
Ghaoui. Numerical methods for H2 related problems
 In Proc. American Control Conf
, 1992
"... Recent results have shown that several H2 and H2related problems can be formulated as convex programs with a nite number of variables. We present an interior point algorithm for the solution of these convex programs and illustrate its application with the standard LQR design. 1. ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
Recent results have shown that several H2 and H2related problems can be formulated as convex programs with a nite number of variables. We present an interior point algorithm for the solution of these convex programs and illustrate its application with the standard LQR design. 1.