On Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities

In the paper we consider the chance-constrained version of an affinely perturbed linear matrix inequality (LMI) constraint, assuming the primitive perturbations to be independent with light-tail distributions (e.g., bounded or Gaussian). Constraints of this type, playing a central role in chance-constrained linear/conic quadratic/semidefinite programming, are typically computationally intractable. The goal of this paper is to develop a tractable approximation to these chance constraints. Our approximation is based on measure concentration results and is given by an explicit system of LMIs. Thus, the approximation is computationally tractable; moreover, it is also safe, meaning that a feasible solution of the approximation is feasible for the chance constraint.

[1]  C. Borell.  The Brunn-Minkowski inequality in Gauss space , 1975 .

[2]  G. Schechtman,et al.  Remarks on Talagrand’s deviation inequality for Rademacher functions , 1990, math/9201208.

[3]  G. Pisier.  Non-commutative vector valued Lp-spaces and completely p-summing maps , 1993, math/9306206.

[4]  Arkadi Nemirovski,et al.  Robust Truss Topology Design via Semidefinite Programming , 1997, SIAM J. Optim..

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

[6]  A. Buchholz.  Operator Khintchine inequality in non-commutative probability , 2001 .

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

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

[9]  Kees Roos,et al.  Extended Matrix Cube Theorems with Applications to µ-Theory in Control , 2003, Math. Oper. Res..

[10]  A. Nemirovski.  On tractable approximations of randomly perturbed convex constraints , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[11]  Benjamin Van Roy,et al.  On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming , 2004, Math. Oper. Res..

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

[13]  A. Nemirovski,et al.  Scenario Approximations of Chance Constraints , 2006 .

[14]  Alexander Shapiro,et al.  Convex Approximations of Chance Constrained Programs , 2006, SIAM J. Optim..

[15]  Garud Iyengar,et al.  Ambiguous chance constrained problems and robust optimization , 2006, Math. Program..

[16]  J. Tropp.  The random paving property for uniformly bounded matrices , 2006, math/0612070.

[17]  Arkadi Nemirovski,et al.  Sums of random symmetric matrices and quadratic optimization under orthogonality constraints , 2007, Math. Program..

[18]  Anthony Man-Cho So,et al.  Improved approximation bound for quadratic optimization problems with orthogonality constraints , 2009, SODA.