SCENARIO MIN-MAX OPTIMIZATION AND THE RISK OF EMPIRICAL COSTS

被引:51
作者
Care, A. [1 ]
Garatti, S. [2 ]
Campi, M. C. [3 ]
机构
[1] Univ Melbourne, Dept Elect & Elect Engn, Parkville, Vic 3052, Australia
[2] Politecn Milan, Dipartimento Elettron Informaz & Bioingn, I-20133 Milan, Italy
[3] Univ Brescia, Dipartimento Ingn Informaz, I-25123 Brescia, Italy
关键词
stochastic optimization; sample-based techniques; scenario approach; data-driven optimization; PROBABILISTIC OPTIMIZATION; DISCRETE-DISTRIBUTIONS; RANDOMIZED SOLUTIONS; CHANCE CONSTRAINTS; PROGRAMS; STABILITY; FEASIBILITY; DESIGN;
D O I
10.1137/130928546
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We consider convex optimization problems in the presence of stochastic uncertainty. The min-max sample-based solution is the solution obtained by minimizing the max of the cost functions corresponding to a finite sample of the uncertainty parameter. The empirical costs are instead the cost values that the solution incurs for the various parameter realizations that have been sampled. Our goal is to evaluate the risks associated with the empirical costs, where the risk associated with a cost is the probability that the cost is exceeded when a new realization of the uncertainty parameter is seen. This task is accomplished without resorting to uncertainty realizations other than those used in optimization. The theoretical result proved in this paper is that these risks form a random vector whose probability distribution is an ordered Dirichlet distribution, irrespective of the probability measure of the stochastic uncertainty parameter. This result provides a distribution-free characterization of the risks associated with the empirical costs that can be used in a variety of application problems.
引用
收藏
页码:2061 / 2080
页数:20
相关论文
共 54 条
[11]   A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality [J].
Campi, M. C. ;
Garatti, S. .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2011, 148 (02) :257-280
[12]   THE EXACT FEASIBILITY OF RANDOMIZED SOLUTIONS OF UNCERTAIN CONVEX PROGRAMS [J].
Campi, M. C. ;
Garatti, S. .
SIAM JOURNAL ON OPTIMIZATION, 2008, 19 (03) :1211-1230
[13]   Interval predictor models: Identification and reliability [J].
Campi, M. C. ;
Calafiore, G. ;
Garatti, S. .
AUTOMATICA, 2009, 45 (02) :382-392
[14]   The scenario approach for systems and control design [J].
Campi, Marco C. ;
Garatti, Simone ;
Prandini, Maria .
ANNUAL REVIEWS IN CONTROL, 2009, 33 (02) :149-157
[15]  
Cramer H., 1936, Journal of the London Mathematical Society, Vs1-11, P290, DOI [10.1112/jlms/s1-11.4.290, DOI 10.1112/JLMS/S1-11.4.290]
[16]   Concavity and efficient points of discrete distributions in probabilistic programming [J].
Dentcheva, D ;
Prékopa, A ;
Ruszczynski, A .
MATHEMATICAL PROGRAMMING, 2000, 89 (01) :55-77
[17]  
Dentcheva D, 2006, PROBABILISTIC AND RANDOMIZED METHODS FOR DESIGN UNDER UNCERTAINTY, P49
[18]   Semi-infinite probabilistic optimization: First-order stochastic dominance constrain [J].
Dentcheva, D ;
Ruszczynski, A .
OPTIMIZATION, 2004, 53 (5-6) :583-601
[19]   Dual methods for probabilistic optimization problems [J].
Dentcheva, D ;
Lai, B ;
Ruszczynski, A .
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2004, 60 (02) :331-346
[20]   Optimization with stochastic dominance constraints [J].
Dentcheva, D ;
Ruszczynski, A .
SIAM JOURNAL ON OPTIMIZATION, 2003, 14 (02) :548-566