A Regularization SAA Scheme for a Stochastic Mathematical Program with Complementarity Constraints

Abstract EN

To reflect uncertain data in practical problems, stochastic versions of the mathematical program with complementarity constraints (MPCC) have drawn much attention in the recent literature.

Our concern is the detailed analysis of convergence properties of a regularization sample average approximation (SAA) method for solving a stochastic mathematical program with complementarity constraints (SMPCC).

The analysis of this regularization method is carried out in three steps: First, the almost sure convergence of optimal solutions of the regularized SAA problem to that of the true problem is established by the notion of epiconvergence in variational analysis.

Second, under MPCC-MFCQ, which is weaker than MPCC-LICQ, we show that any accumulation point of Karash-Kuhn-Tucker points of the regularized SAA problem is almost surely a kind of stationary point of SMPCC as the sample size tends to infinity.

Finally, some numerical results are reported to show the efficiency of the method proposed.