Control System Analysis and Synthesis via Linear Matrix Inequalities

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 efficiently....

Full description

Saved in:
Bibliographic Details
Published inAmerican Control Conference, 1993 pp. 2147 - 2154
Main Authors Boyd, S., Balakrishnan, V., Feron, E., ElGhaoui, L.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.1993
Subjects
Online AccessGet full text
ISBN0780308603
9780780308602
DOI10.23919/ACC.1993.4793262

Cover

More Information
Summary: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 efficiently. 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 ("multi-model control"), optimal transfer matrix realization, norm scaling, synthesis of multipliers for Popov-like analysis of systems with unknown gains, and many others. Full details can be found in the references cited.
ISBN:0780308603
9780780308602
DOI:10.23919/ACC.1993.4793262