DocumentCode
2173942
Title
Convex relaxations for robust control problems
Author
Vicino, Antonio ; Garulli, Andrea
Author_Institution
Dipt. di Ing. dell´Inf., Univ. di Siena, Rome, Italy
fYear
2007
fDate
2-5 July 2007
Firstpage
5001
Lastpage
5002
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.
Keywords
control system synthesis; convex programming; linear matrix inequalities; polynomials; robust control; LMI feasibility test; control system design; convex optimization tools; convex relaxations; nonconvex problems; polynomial form positivity; robust analysis; robust control problems; Convex functions; Linear matrix inequalities; Lyapunov methods; Optimization; Polynomials; Robust control; Robustness;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Conference (ECC), 2007 European
Conference_Location
Kos
Print_ISBN
978-3-9524173-8-6
Type
conf
Filename
7069032
Link To Document