Random convex programs: Dealing with the non-existing solution nuisance

Random convex programs (RCPs) are convex optimization problems subject to a finite number of constraints that are extracted at random according to some probability distribution. The optimal objective of an RCP, and its associated optimal solution (when it exists), are random variables: RCP theory is mainly concerned with providing probabilistic assessments on the probability of objective and constraint violation in random convex programs. In a recent contribution [5], the authors provide a tight upper bound on the constraint violation probability for a restricted class of random convex programs that are assumed to be feasible and attain an optimal solution in every possible problem realization. Here, we remove this restriction and we provide a result holding for general random convex programs.

[1]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[2]  Micha Sharir,et al.  A Combinatorial Bound for Linear Programming and Related Problems , 1992, STACS.

[3]  Emo Welzl,et al.  A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization , 2001, Discret. Comput. Geom..

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

[5]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

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

[7]  Marco C. Campi,et al.  The exact feasibility of randomized solutions of robust convex programs , 2008 .

[8]  Giuseppe Carlo Calafiore,et al.  Interval predictor models: Identification and reliability , 2009, Autom..

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

[10]  Giuseppe Carlo Calafiore,et al.  Notes on the Scenario Design Approach , 2009, IEEE Transactions on Automatic Control.

[11]  J. Matoušek,et al.  On geometric optimization with few violated constraints , 1994, SCG '94.

[12]  Marco C. Campi,et al.  The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs , 2008, SIAM J. Optim..

[13]  John F. Canny,et al.  An efficient approach to removing geometric degeneracies , 1992, SCG '92.