A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization

We present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. Moments of arbitrary order, as well as nonpolynomial moments, can be included in the formulation. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of risk-aversion, with classic robust optimization at one end of the spectrum and stochastic programming at the other. Although our primary motivation is to solve distributionally robust optimization problems with moment uncertainty, the cutting surface method for general semi-infinite convex programs is also of independent interest. The proposed method is applicable to problems with nondifferentiable semi-infinite constraints indexed by an infinite dimensional index set. Examples comparing the cutting surface algorit...

[1]  Dávid Papp,et al.  Semidefinite Characterization of Sum-of-Squares Cones in Algebras , 2013, SIAM J. Optim..

[2]  Masakazu Muramatsu,et al.  Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity , 2004 .

[3]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[4]  Xuan Vinh Doan,et al.  Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion , 2010, Math. Oper. Res..

[5]  S. Vempala.  Geometric Random Walks: a Survey , 2007 .

[6]  Herbert E. Scarf,et al.  A Min-Max Solution of an Inventory Problem , 1957 .

[7]  Hariharan Narayanan,et al.  Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming , 2012, Math. Oper. Res..

[8]  P. R. Gribik,et al.  A central-cutting-plane algorithm for semi-infinite programming problems , 1979 .

[9]  Christian Kleiber,et al.  Multivariate distributions and the moment problem , 2013, J. Multivar. Anal..

[10]  Kenneth O. Kortanek,et al.  A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems , 1993, SIAM J. Optim..

[11]  Bruno Betrò,et al.  An accelerated central cutting plane algorithm for linear semi-infinite programming , 2004, Math. Program..

[12]  Sanjay Mehrotra,et al.  Generating Moment Matching Scenarios Using Optimization Techniques , 2013, SIAM J. Optim..

[13]  Marco A. López,et al.  Semi-infinite programming , 2007, Eur. J. Oper. Res..

[14]  Jesús A. De Loera,et al.  FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension , 2008, Math. Program..

[15]  He Zhang,et al.  Models and algorithms for distributionally robust least squares problems , 2013, Mathematical Programming.

[16]  Michal Kaut,et al.  A Heuristic for Moment-Matching Scenario Generation , 2003, Comput. Optim. Appl..

[17]  S. Vempala,et al.  Hit-and-Run from a Corner , 2006 .

[18]  Didier Henrion,et al.  GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi , 2003, TOMS.

[19]  R. Tichatschke,et al.  A cutting-plane method for quadratic semi infinite programming problems , 1988 .

[20]  Sanjay Mehrotra,et al.  An empirical evaluation of walk-and-round heuristics for mixed integer linear programs , 2013, Comput. Optim. Appl..

[21]  Yinyu Ye,et al.  Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems , 2010, Oper. Res..