Several problems relevant to robust analysis and design of control systems can be formulated in terms of positivity of polynomial forms. Sufficient conditions for testing positivity of polynomials have been recently cast as LMI feasibility tests, thus providing the theoretical basis to devise families of convex relaxations for several classes of nonconvex problems. Therefore, it is now possible to tackle such problems by exploiting efficient convex optimization tools.
Vicino, A., Garulli, A. (2007). Convex relaxations for robust control problems. In Proceedings of the European Control Conference 2007 (pp.5001-5002). New York : IEEE.
Convex relaxations for robust control problems
VICINO, ANTONIO;GARULLI, ANDREA
2007-01-01
Abstract
Several problems relevant to robust analysis and design of control systems can be formulated in terms of positivity of polynomial forms. Sufficient conditions for testing positivity of polynomials have been recently cast as LMI feasibility tests, thus providing the theoretical basis to devise families of convex relaxations for several classes of nonconvex problems. Therefore, it is now possible to tackle such problems by exploiting efficient convex optimization tools.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/18952
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo