Inner approximations for polynomial matrix inequalities and robust stability regions - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Automatic Control Année : 2012

Inner approximations for polynomial matrix inequalities and robust stability regions

Résumé

Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by parametrized polynomial matrix inequalities (PMI). These feasibility sets are typically nonconvex. Given a parametrized PMI set, we provide a hierarchy of linear matrix inequality (LMI) problems whose optimal solutions generate inner approximations modelled by a single polynomial sublevel set. Those inner approximations converge in a strong analytic sense to the nonconvex original feasible set, with asymptotically vanishing conservatism. One may also impose the hierarchy of inner approximations to be nested or convex. In the latter case they do not converge any more to the feasible set, but they can be used in a convex optimization framework at the price of some conservatism. Finally, we show that the specific geometry of nonconvex polynomial stability regions can be exploited to improve convergence of the hierarchy of inner approximations.
Fichier principal
Vignette du fichier
innerpmi.pdf (512.48 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00588754 , version 1 (26-04-2011)
hal-00588754 , version 2 (02-02-2012)

Identifiants

Citer

Didier Henrion, Jean-Bernard Lasserre. Inner approximations for polynomial matrix inequalities and robust stability regions. IEEE Transactions on Automatic Control, 2012, 57 (6), p.1456-1467. ⟨hal-00588754v2⟩
175 Consultations
282 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More