scholarly journals Improving Sample Average Approximation Using Distributional Robustness

Author(s):  
Edward Anderson ◽  
Andy Philpott

Sample average approximation is a popular approach to solving stochastic optimization problems. It has been widely observed that some form of robustification of these problems often improves the out-of-sample performance of the solution estimators. In estimation problems, this improvement boils down to a trade-off between the opposing effects of bias and shrinkage. This paper aims to characterize the features of more general optimization problems that exhibit this behaviour when a distributionally robust version of the sample average approximation problem is used. The paper restricts attention to quadratic problems for which sample average approximation solutions are unbiased and shows that expected out-of-sample performance can be calculated for small amounts of robustification and depends on the type of distributionally robust model used and properties of the underlying ground-truth probability distribution of random variables. The paper was written as part of a New Zealand funded research project that aimed to improve stochastic optimization methods in the electric power industry. The authors of the paper have worked together in this domain for the past 25 years.

2013 ◽  
Vol 303-306 ◽  
pp. 1319-1322
Author(s):  
Yun Yun Nie

Min-max stochastic optimization is a kind of important problems in stochastic optimization, which has been widely applied in subjects such as inventory theory and robust optimization and engineering field. In this paper, we present sample average approximation(SAA) method for a class of min-max stochastic optimization problems, based on a nonlinear Lagrangian function. Convergence of the SAA estimators are analyzed by means of epi-convergence theory,when the Lagrange multiplier vector is optimal and the parameter is small enough.


2018 ◽  
Vol 2018 ◽  
pp. 1-13
Author(s):  
Chuanmei Wang ◽  
Suxiang He ◽  
Haiying Wu

This paper proposes an implementable SAA (sample average approximation) nonlinear Lagrange algorithm for the constrained minimax stochastic optimization problem based on the sample average approximation method. A computable nonlinear Lagrange function with sample average approximation functions of original functions is minimized and the Lagrange multiplier is updated based on the sample average approximation functions of original functions in the algorithm. And it is shown that the solution sequences obtained by the novel algorithm for solving subproblem converge to their true counterparts with probability one as the sample size approximates infinity under some moderate assumptions. Finally, numerical experiments are carried out for solving some typical test problems and the obtained numerical results preliminarily demonstrate that the proposed algorithm is promising.


Sign in / Sign up

Export Citation Format

Share Document