Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness

Robust semidefinite programming problems with rational dependence on uncertainties are known to have a wide range of applications, in particular in robust control. It is well established how to systematically construct relaxations on the basis of the full block S-procedure. In general, such relaxations are expected to be conservative, but for concrete problem instances they are often observed to be tight. The main purpose of this paper is to suggest novel computationally verifiable conditions for when general classes of linear matrix inequality relaxations do not involve any conservatism. If the convex set of uncertainties is finitely generated, we suggest a novel sequence of relaxations which can be proved to be asymptotically exact. Finally, our results are applied to the particularly relevant robustness analysis problem for linear time-invariant dynamical systems affected by uncertainties that are full ellipsoidal or repeated and contained in intersections of disks or circles. This leads to extensions of known results on relaxation exactness for small block structures, including an elementary proof for tightness of standard structured singular value computations for three full complex uncertainty blocks.

[1]  Pierre Apkarian,et al.  Monotonic relaxations for robust control: new characterizations , 2002, IEEE Trans. Autom. Control..

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

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

[4]  A. Rantzer.  On the Kalman-Yakubovich-Popov lemma , 1996 .

[5]  C. Scherer.  Mixed H2/H∞ control for time‐varying and linear parametrically‐varying systems , 1996 .

[6]  C. Scherer.  A full block S-procedure with applications , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[7]  Gjerrit Meinsma,et al.  Rank-one LMIs and Lyapunov's inequality , 2001, IEEE Trans. Autom. Control..

[8]  M. Fu,et al.  A dual formulation of mixed μ and on the losslessness of (D, G) scaling , 1997, IEEE Trans. Autom. Control..

[9]  Christopher L. DeMarco,et al.  The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix , 1994, Math. Control. Signals Syst..

[10]  H. Ozbay,et al.  On the /spl Nscr//spl Pscr/-hardness of the purely complex /spl mu/ computation, analysis/synthesis, and some related problems in multidimensional systems , 1995, Proceedings of 1995 American Control Conference - ACC'95.

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

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

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

[14]  Carsten W. Scherer,et al.  When are Multiplier Relaxations Exact , 2003 .

[15]  Tetsuya Iwasaki,et al.  Robust stability analysis with quadratic separator: parametric time-varying uncertainty case , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

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

[17]  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).

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

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

[20]  S. Hara,et al.  Well-posedness of feedback systems: insights into exact robustness analysis and approximate computations , 1998, IEEE Trans. Autom. Control..

[21]  Shuzhong Zhang,et al.  On Cones of Nonnegative Quadratic Functions , 2003, Math. Oper. Res..

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

[23]  Roberto Tempo,et al.  Probabilistic robust design with linear quadratic regulators , 2001, Syst. Control. Lett..

[24]  Shinji Hara,et al.  Dynamical system design from a control perspective: finite frequency positive-realness approach , 2003, IEEE Trans. Autom. Control..

[25]  Etienne de Klerk,et al.  Approximation of the Stability Number of a Graph via Copositive Programming , 2002, SIAM J. Optim..

[26]  J. Lasserre,et al.  Detecting global optimality and extracting solutions in GloptiPoly , 2003 .

[27]  Maarten Steinbuch,et al.  Parametric Uncertainty Modeling using LFTs , 1993, 1993 American Control Conference.

[28]  Eric Feron,et al.  Estimating the conservatism of Popov's criterion for real parametric uncertainties , 1997 .

[29]  P. Gahinet,et al.  A linear matrix inequality approach to H∞ control , 1994 .