A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs

Many robust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F@?{f(x,@d)=<0,@d@?D}. This set typically contains an infinite and uncountable number of inequalities, and it has been proved that the related robust feasibility problem is numerically hard to solve in general. In this paper, we discuss a family of cutting plane methods that solve efficiently a probabilistically relaxed version of the problem. Specifically, under suitable hypotheses, we show that an Analytic Center Cutting Plane scheme based on a probabilistic oracle returns in a finite and pre-specified number of iterations a solution x which is feasible for most of the members of F, except possibly for a subset having arbitrarily small probability measure.

[1]  Yasuaki Oishi,et al.  Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities , 2007, Autom..

[2]  Yasuaki Oishi,et al.  Probabilistic design of a robust state-feedback controller based on parameter-dependent Lyapunov functions , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[3]  John E. Mitchell,et al.  Polynomial Interior Point Cutting Plane Methods , 2003, Optim. Methods Softw..

[4]  Giuseppe Carlo Calafiore,et al.  Stochastic algorithms for exact and approximate feasibility of robust LMIs , 2001, IEEE Trans. Autom. Control..

[5]  Giuseppe Carlo Calafiore,et al.  Uncertain convex programs: randomized solutions and confidence levels , 2005, Math. Program..

[6]  Yinyu Ye,et al.  Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems , 1996, SIAM J. Optim..

[7]  Michel Verhaegen,et al.  The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems , 2006 .

[8]  Eduardo F. Camacho,et al.  A new vertex result for robustness problems with interval matrix uncertainty , 2007, 2007 European Control Conference (ECC).

[9]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[10]  John Darzentas,et al.  Problem Complexity and Method Efficiency in Optimization , 1983 .

[11]  Stephen P. Boyd,et al.  Method of centers for minimizing generalized eigenvalues , 1993, Linear Algebra and its Applications.

[12]  B. Ross Barmish,et al.  New Tools for Robustness of Linear Systems , 1993 .

[13]  Laurent El Ghaoui,et al.  Robust Solutions to Uncertain Semidefinite Programs , 1998, SIAM J. Optim..

[14]  R. Tempo,et al.  Randomized Algorithms for Analysis and Control of Uncertain Systems , 2004 .

[15]  Michel Verhaegen,et al.  An ellipsoid algorithm for probabilistic robust controller design , 2003, Syst. Control. Lett..

[16]  Pravin M. Vaidya,et al.  A cutting plane algorithm for convex programming that uses analytic centers , 1995, Math. Program..

[17]  Thomas D. Sandry,et al.  Probabilistic and Randomized Methods for Design Under Uncertainty , 2007, Technometrics.

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

[19]  Giuseppe Carlo Calafiore,et al.  The scenario approach to robust control design , 2006, IEEE Transactions on Automatic Control.

[20]  Hidenori Kimura,et al.  Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities , 2003, Autom..

[21]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[22]  Jean-Philippe Vial,et al.  Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method , 2002, Optim. Methods Softw..

[23]  Jean-Philippe Vial,et al.  Shallow, deep and very deep cuts in the analytic center cutting plane method , 1999, Math. Program..

[24]  Pierre-Alexandre Bliman,et al.  A Convex Approach to Robust Stability for Linear Systems with Uncertain Scalar Parameters , 2003, SIAM J. Control. Optim..

[25]  Giuseppe Carlo Calafiore.  Cutting plane methods for probabilistically-robust feasibility problems , 2006 .

[26]  N. Z. Shor.  Utilization of the operation of space dilatation in the minimization of convex functions , 1972 .

[27]  Olivier Péton.  The homogeneous analytic center cutting plane method , 2002 .

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

[29]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[30]  N. Z. Shor.  Cut-off method with space extension in convex programming problems , 1977, Cybernetics.

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

[32]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..