CVaR-constrained stochastic programming reformulation for stochastic nonlinear complementarity problems
We reformulate a stochastic nonlinear complementarity problem as a stochastic programming problem which minimizes an expected residual defined by a restricted NCP function with nonnegative constraints and CVaR constraints which guarantee the stochastic nonlinear function being nonnegative with a high probability. By applying smoothing technique and penalty method, we propose a penalized smoothing sample average approximation algorithm to solve the CVaR-constrained stochastic programming. We show that the optimal solution of the penalized smoothing sample average approximation problem converges to the solution of the corresponding nonsmooth CVaR-constrained stochastic programming problem almost surely. Finally, we report some preliminary numerical test results.
KeywordsStochastic complementarity problems Sample average approximation CVaR Penalized smoothing method R0 function
- 7.Facchinei, F., Pang, J.S.: Finite-dimensional variational inequalities and complementarity problems vol. 1. Springer, New York (2003) Google Scholar
- 20.Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Heidelberg (2004) Google Scholar
- 21.Rockafellar, R.T., Uryasev, S.: Optimization of conditional value-at-risk. J. Risk 2, 21–41 (2000) Google Scholar