求解风险厌恶随机规划问题的样本均值近似方法的一阶渐近性

First order asymptotics of the sample average approximation method to solve risk averse stochastic programs

Mathematical Programming · 2023
被引 5
ABS 4

中文导读

研究了样本均值近似方法求解风险厌恶随机规划问题时最优值的统计性质,推导了中心极限定理类型的结果,并应用于分段Hölder连续目标函数的情形。

Abstract

Abstract We investigate statistical properties of the optimal value of the Sample Average Approximation of stochastic programs, continuing the study (Krätschmer in Nonasymptotic upper estimates for errors of the sample average approximation method to solve risk averse stochastic programs, 2023. Forthcoming in SIAM J. Optim.). Central Limit Theorem type results are derived for the optimal value. As a crucial point the investigations are based on a new type of conditions from the theory of empirical processes which do not rely on pathwise analytical properties of the goal functions. In particular, continuity or convexity in the parameter is not imposed in advance as usual in the literature on the Sample Average Approximation method. It is also shown that the new condition is satisfied if the paths of the goal functions are Hölder continuous so that the main results carry over in this case. Moreover, the main results are applied to goal functions whose paths are piecewise Hölder continuous as e.g. in two stage mixed-integer programs. The main results are shown for classical risk neutral stochastic programs, but we also demonstrate how to apply them to the Sample Average Approximation of risk averse stochastic programs. In this respect we consider stochastic programs expressed in terms of absolute semideviations and divergence risk measures.

随机规划风险厌恶样本均值近似渐近分析经验过程