Stochastic Optimization Problems with CVaR Risk Measure and Their Sample Average Approximation
MetadataShow full item record
We provide a refined convergence analysis for the SAA (sample average approximation) method applied to stochastic optimization problems with either single or mixed CVaR (conditional value-at-risk) measures. Under certain regularity conditions, it is shown that any accumulation point of the weak GKKT (generalized Karush-Kuhn-Tucker) points produced by the SAA method is almost surely a weak stationary point of the original CVaR or mixed CVaR optimization problems. In addition, it is shown that, as the sample size increases, the difference of the optimal values between the SAA problems and the original problem tends to zero with probability approaching one exponentially fast.
Showing items related by title, author, creator and subject.
A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measureMeng, F.; Sun, Jie; Goh, M. (2011)This paper is concerned with solving single CVaR and mixed CVaR minimization problems. A CHKS-type smoothing sample average approximation (SAA) method is proposed for solving these two problems, which retains the convexity ...
Chen, W.; Sim, M.; Sun, Jie; teo, C. (2010)We review and develop different tractable approximations to individual chance constrained problems in robust optimization on a varieties of uncertainty sets and show their interesting connections with bounds on the ...
Li, Bin (2011)In this thesis, we consider several types of optimal control problems with constraints on the state and control variables. These problems have many engineering applications. Our aim is to develop efficient numerical methods ...