Tractable Approximations to Robust Conic Optimization Problems

In earlier proposals, the robust counterpart of conic optimization problems exhibits a lateral increase in complexity, i.e., robust linear programming problems (LPs) become second order cone problems (SOCPs), robust SOCPs become semidefinite programming problems (SDPs), and robust SDPs become NP-hard. We propose a relaxed robust counterpart for general conic optimization problems that (a) preserves the computational tractability of the nominal problem; specifically the robust conic optimization problem retains its original structure, i.e., robust LPs remain LPs, robust SOCPs remain SOCPs and robust SDPs remain SDPs, and (b) allows us to provide a guarantee on the probability that the robust solution is feasible when the uncertain coefficients obey independent and identically distributed normal distributions.

[1]  James Renegar,et al.  A mathematical view of interior-point methods in convex optimization , 2001, MPS-SIAM series on optimization.

[2]  Arkadi Nemirovski,et al.  Robust solutions of Linear Programming problems contaminated with uncertain data , 2000, Math. Program..

[3]  Levent Tunçel,et al.  Characterization of the barrier parameter of homogeneous convex cones , 1998, Math. Program..

[4]  Melvyn Sim,et al.  Robust linear optimization under general norms , 2004, Oper. Res. Lett..

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

[6]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[7]  Allen L. Soyster,et al.  Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..

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

[9]  Melvyn Sim,et al.  Robust Discrete Optimization , 2003 .

[10]  Laurent El Ghaoui,et al.  Robust Solutions to Least-Squares Problems with Uncertain Data , 1997, SIAM J. Matrix Anal. Appl..

[11]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[12]  A Ben Tal,et al.  ROBUST SOLUTIONS TO UNCERTAIN PROGRAMS , 1999 .

[13]  Arkadi Nemirovski,et al.  On the quality of SDP approximations of uncertain SDP programs , 1998 .

[14]  R. Freund.  Review of A mathematical view of interior-point methods in convex optimization, by James Renegar, SIAM, Philadelphia, PA , 2004 .

[15]  John M. Wilson,et al.  Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..

[16]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

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

[18]  L El Ghaoui,et al.  ROBUST SOLUTIONS TO LEAST-SQUARE PROBLEMS TO UNCERTAIN DATA MATRICES , 1997 .

[19]  A. Nemirovski.  Regular Banach Spaces and Large Deviations of Random Sums , 2004 .

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

[21]  Dimitris Bertsimas,et al.  Constrained Stochastic LQC: A Tractable Approach , 2007, IEEE Transactions on Automatic Control.

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