@Article{JCM-24-6,
author = {Meng, Fan-wen and Xu, Hui-fu},
title = {Exponential Convergence of Sample Average Approximation Methods for a Class of Stochastic Mathematical Programs with Complementarity Constraints},
journal = {Journal of Computational Mathematics},
year = {2006},
volume = {24},
number = {6},
pages = {733--748},
abstract = {<p style="text-align: justify;">In this paper, we propose a Sample Average Approximation (SAA) method for a class of Stochastic Mathematical Programs with Complementarity Constraints (SMPCC) recently considered by Birbil, Gürkan and Listes [3]. We study the statistical properties of obtained SAA estimators. In particular we show that under moderate conditions a sequence of weak stationary points of SAA programs converge to a weak stationary point of the true problem with probability approaching one at exponential rate as the sample size tends to infinity. To implement the SAA method more efficiently, we incorporate the method with some techniques such as Scholtes&#39; regularization method and the well known smoothing NCP method. Some preliminary numerical results are reported.</p>},
issn = {1991-7139},
doi = {https://doi.org/2006-JCM-8787},
url = {https://global-sci.com/article/85114/exponential-convergence-of-sample-average-approximation-methods-for-a-class-of-stochastic-mathematical-programs-with-complementarity-constraints}
}