LMI Techniques for Optimization Over Polynomials in Control: A Survey

By Graziano Chesi. IEEE Transactions on Automatic Control, 2010

410 citations recorded by the source corpus.

Numerous tasks in control systems involve optimization problems over polynomials, and unfortunately these problems are in general nonconvex. In order to cope with this difficulty, linear matrix inequality (LMI) techniques have been introduced because they allow one to obtain bounds to the sought solution by solving convex optimization problems and because the conservatism of these bounds can be decreased in general by suitably increasing the size of the problems. This survey aims to provide the reader with a significant overview of the LMI techniques that are used in control systems for tackling optimization problems over polynomials, describing approaches such as decomposition in sum of squares, Positivstellensatz, theory of moments, Pólya's theorem, and matrix dilation. Moreover, it aims to provide a collection of the essential problems in control systems where these LMI techniques are used, such as stability and performance investigations in nonlinear systems, uncertain systems, time-delay systems, and genetic regulatory networks. It is expected that this survey may be a concise useful reference for all readers.

Subfields: Control and Systems Engineering, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/81696da5e8c69295cf0acf8c399c6595b377e1d4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Control and Systems Engineering

  1. Derong Liu
  2. Sigurdur Freyr Hafstein
  3. Vahid Johari Majd
  4. Peter Giesl
  5. Saleh Mobayen
  6. Philip O. Ogunbona
  7. Tiago J. M. Dezuo
  8. Milan Korda

In Numerical Analysis

  1. Sigurdur Freyr Hafstein
  2. Peter Giesl
  3. Derong Liu
  4. Tiago J. M. Dezuo
  5. Milan Korda
  6. Huaguang Zhang
  7. Saleh Mobayen
  8. Alexandre Trofino

Citations in the corpus