Matrix Sum-of-Squares Relaxations for Robust Semi-Definite Programs

We consider robust semi-definite programs which depend polynomially or rationally on some uncertain parameter that is only known to be contained in a set with a polynomial matrix inequality description. On the basis of matrix sum-of-squares decompositions, we suggest a systematic procedure to construct a family of linear matrix inequality relaxations for computing upper bounds on the optimal value of the corresponding robust counterpart. With a novel matrix-version of Putinar's sum-of-squares representation for positive polynomials on compact semi-algebraic sets, we prove asymptotic exactness of the relaxation family under a suitable constraint qualification. If the uncertainty region is a compact polytope, we provide a new duality proof for the validity of Putinar's constraint qualification with an a priori degree bound on the polynomial certificates. Finally, we point out the consequences of our results for constructing relaxations based on the so-called full-block S-procedure, which allows to apply recently developed tests in order to computationally verify the exactness of possibly small-sized relaxations.

[1]  J. Lasserre,et al.  Solving nonconvex optimization problems , 2004, IEEE Control Systems.

[2]  Tetsuya Iwasaki,et al.  LPV system analysis via quadratic separator for uncertain implicit systems , 2001, IEEE Trans. Autom. Control..

[3]  Markus Schweighofer,et al.  Optimization of Polynomials on Compact Semialgebraic Sets , 2005, SIAM J. Optim..

[4]  M. Kojima.  Sums of Squares Relaxations of Polynomial Semidefinite Programs , 2003 .

[5]  K. Schmüdgen.  TheK-moment problem for compact semi-algebraic sets , 1991 .

[6]  J. Doyle,et al.  Robust and optimal control , 1995, Proceedings of 35th IEEE Conference on Decision and Control.

[7]  Graziano Chesi,et al.  An LMI-based approach for characterizing the solution set of polynomial systems , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[8]  Pablo A. Parrilo,et al.  Minimizing Polynomial Functions , 2001, Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science.

[9]  Carsten W. Scherer,et al.  LMI Relaxations in Robust Control , 2006, Eur. J. Control.

[10]  Graziano Chesi,et al.  Robust stability of polytopic systems via polynomially parameter-dependent Lyapunov functions , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[11]  Man-Duen Choi.  Completely positive linear maps on complex matrices , 1975 .

[12]  Shinji Hara,et al.  Well-posedness of feedback systems: insights into exact robustness analysis , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[13]  Masakazu Muramatsu,et al.  An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones , 2007, Math. Program..

[14]  Vincent D. Blondel,et al.  Proceedings of the 2000 American Control Conference , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[15]  Harish K. Pillai,et al.  Lossless and Dissipative Distributed Systems , 2001, SIAM J. Control. Optim..

[16]  Olga Taussky-Todd.  SOME CONCRETE ASPECTS OF HILBERT'S 17TH PROBLEM , 1996 .

[17]  C. W. Scherer,et al.  Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness , 2005, SIAM J. Matrix Anal. Appl..

[18]  A. Nemirovski,et al.  Robust Semidefinite Programming ∗ , 2008 .

[19]  Kees Roos,et al.  Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems , 2002, SIAM J. Optim..

[20]  P. Parrilo.  Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .

[21]  Laurent El Ghaoui,et al.  Advances in linear matrix inequality methods in control: advances in design and control , 1999 .

[22]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[23]  Graziano Chesi,et al.  Homogeneous Lyapunov functions for systems with structured uncertainties , 2003, Autom..

[24]  Arkadi Nemirovski,et al.  On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty , 2002, SIAM J. Optim..

[25]  C. W. Scherer,et al.  LMI relaxations in robust control ( tutorial ) , 2004 .

[26]  K. Schmüdgen.  TheK-moment problem for compact semi-algebraic sets , 1991 .

[27]  A. Prestel,et al.  Distinguished representations of strictly positive polynomials , 2001 .

[28]  A. Garulli,et al.  Positive Polynomials in Control , 2005 .

[29]  Andrew Packard,et al.  The complex structured singular value , 1993, Autom..

[30]  C. Scherer.  Higher-order relaxations for robust LMI problems with verifications for exactness , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[31]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[32]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[33]  C. Scherer,et al.  Fixed order /spl Hscr//sub /spl infin//-synthesis: computing optimal values by robust performance analysis , 2004, Proceedings of the 2004 American Control Conference.

[34]  B. Reznick,et al.  A new bound for Pólya's Theorem with applications to polynomials positive on polyhedra , 2001 .

[35]  Carsten W. Scherer,et al.  LPV control and full block multipliers , 2001, Autom..

[36]  Etienne de Klerk,et al.  Global optimization of rational functions: a semidefinite programming approach , 2006, Math. Program..

[37]  C.W.J. Hol,et al.  Fixed Order Z-synthesis: Computing Optimal Values by Robust Performance Analysis , 2004 .