full
search.png

Search

close.png

Cancel

arrow
Volume 24, Issue 6
Exponential Convergence of Sample Average Approximation Methods for a Class of Stochastic Mathematical Programs with Complementarity Constraints

Fan-wen Meng & Hui-fu Xu

J. Comp. Math., 24 (2006), pp. 733-748.

Published online: 2006-12

Preview Full PDF 2456 23433

Cited by

google scholar semantic scholar
Export citation
  • Abstract

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' regularization method and the well known smoothing NCP method. Some preliminary numerical results are reported.

  • Keywords

Stochastic mathematical programs with complementarity constraints, Sample average approximation, Weak stationary points, Exponential convergence.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-24-733, 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 = {

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' regularization method and the well known smoothing NCP method. Some preliminary numerical results are reported.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/8787.html} }
TY - JOUR T1 - Exponential Convergence of Sample Average Approximation Methods for a Class of Stochastic Mathematical Programs with Complementarity Constraints AU - Meng , Fan-wen AU - Xu , Hui-fu JO - Journal of Computational Mathematics VL - 6 SP - 733 EP - 748 PY - 2006 DA - 2006/12 SN - 24 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/8787.html KW - Stochastic mathematical programs with complementarity constraints, Sample average approximation, Weak stationary points, Exponential convergence. AB -

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' regularization method and the well known smoothing NCP method. Some preliminary numerical results are reported.

Meng , Fan-wen and Xu , Hui-fu. (2006). Exponential Convergence of Sample Average Approximation Methods for a Class of Stochastic Mathematical Programs with Complementarity Constraints. Journal of Computational Mathematics. 24 (6). 733-748. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard