Convergence Analysis of Sample Average Approximation Methods for a Class of Stochastic Mathematical Programs with Equality Constraints

Published Online:https://doi.org/10.1287/moor.1070.0260

References

  • Artstein Z., Vitale R. A. A strong law of large numbers for random compact sets. Ann. Probab. (1975) 3:879–882CrossrefGoogle Scholar
  • Artstein Z., Wets R. J-B. Consistency of minimizers and the SLLN for stochastic programs. J. Convex Anal. (1995) 2:1–17Google Scholar
  • Aubin J.-P., Frankowska H.Set-Valued Analysis (1990) (Birkhauser, Boston, MA) Google Scholar
  • Birbil S. I., Gurkan G., Listes O. L. Simulation-based solution of stochastic mathematical programs with complementarity constraints: Sample-path analysis. (2004) . Working paper, Center for Economic Research, Tilburg University, Tilburg, The NetherlandsGoogle Scholar
  • Birge J., Louveaux F.Introduction to Stochastic Programming (1997) (Springer-Verlag, New York) Springer Series in Operations ResearchGoogle Scholar
  • Brønsted A., Rockafellar R. T. On the subdifferentiability of convex functions. Proc. Amer. Math. Soc. (1965) 16:605–611Google Scholar
  • Chen X., Qi L., Sun D. Global and superlinear convergence of the smoothing Newton’s method and its application to general box constrained variational inequalities. Math. Comput. (1998) 67:519–540CrossrefGoogle Scholar
  • Clarke F. H.Optimization and Nonsmooth Analysis (1983) (Wiley, New York) Google Scholar
  • Facchinei F., Pang J.-S.Finite-Dimensional Variational Inequalities and Complementarity Problems (2003) (Springer, New York) Google Scholar
  • Fischer A. A special Newton-type optimization method. Optimization (1992) 24:269–284CrossrefGoogle Scholar
  • Homen-De-Mello T. Estimation of derivatives of nonsmooth performance measures in regenerative systems. Math. Oper. Res. (2001) 26:741–768LinkGoogle Scholar
  • Hiriart-Urruty J.-B. Refinements of necessary optimality conditions in nondifferentiable programming I. Appl. Math. Optim. (1979) 5:63–82CrossrefGoogle Scholar
  • Kanzow C. Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix Anal. Appl. (1996) 17:851–868CrossrefGoogle Scholar
  • King A. J., Wets R. J-B. Epi-consistency of convex stochastic programs. Stochastics Stochastics Rep. (1991) 34:83–92CrossrefGoogle Scholar
  • Lin G.-H., Chen X., Fukushima M. Smoothing implicit programming approaches for stochastic mathematical programs with linear complementarity constraints. (2003) . http://www.amp.i.kyoto-u.ac.jp/tecrep/index-e.htmlGoogle Scholar
  • Luo Z.-Q., Pang J.-S., Ralph D.Mathematical Programs with Equilibrium Constraints (1996) (Cambridge University Press, Cambridge, UK) CrossrefGoogle Scholar
  • Meng F., Xu H. A regularized sample average approximation method for stochastic mathematical programs with nonsmooth equality constraints. SIAM J. Optim. (2006) 17:891–919CrossrefGoogle Scholar
  • Patriksson M., Wynter L. Stochastic mathematical programs with equilibrium constraints. Oper. Res. Lett. (1999) 25:159–167CrossrefGoogle Scholar
  • Plambeck E. L., Fu B. R., Robinson S. M., Suri R. Sample-path optimization of convex stochastic performance functions. Math. Programming (1996) 75:137–176CrossrefGoogle Scholar
  • Polak E., Mayne D. Q., Wardi Y. On the extension of constrained optimization algorithms from differentiable to nondifferentiable problems. SIAM J. Control Optim. (1983) 21:179–203CrossrefGoogle Scholar
  • Ralph D., Xu H. Implicit smoothing and its application to optimization with piecewise smooth equality constraints. Optim. Theory Appl. (2005) 124:673–699CrossrefGoogle Scholar
  • Robinson S. M. Analysis of sample-path optimization. Math. Oper. Res. (1996) 21:513–528LinkGoogle Scholar
  • Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) CrossrefGoogle Scholar
  • Rockafellar R. T., Wets R. J-B. Stochastic convex programming: Kuhn-Tucker conditions. J. Math. Econom. (1975) 2:349–370CrossrefGoogle Scholar
  • Rockafellar R. T., Wets R. J-B.Variational Analysis (1998) (Springer-Verlag, Berlin, Germany) CrossrefGoogle Scholar
  • Rubinstein R. Y., Shapiro A.Discrete Events Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Methods (1993) (John Wiley and Sons, New York) Google Scholar
  • Ruszczyński A., Shapiro A., Ruszczyński A., Shapiro A. Stochastic programming. Handbooks in OR & MS. Stochastic Programming (2003) 10(North-Holland Publishing Company, Amsterdam, The Netherlands) Google Scholar
  • Santoso T., Ahmed S., Goetschalckx M., Shapiro A. A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. (2005) 167:96–115CrossrefGoogle Scholar
  • Scholtes S. Introduction to piecewise smooth equations. (1994) . Habilitation thesis, University of Karlsruhe, Karlsruhe, GermanyGoogle Scholar
  • Shapiro A., Ruszczyński A., Shapiro A. Monte Carlo sampling methods. Handbooks in OR & MS. Stochastic Programming (2003) 10(North-Holland Publishing Company, Amsterdam, The Netherlands) CrossrefGoogle Scholar
  • Shapiro A. Stochastic mathematical programs with equilibrium constraints. J. Optim. Theor. Appl. (2006) 128:223–243CrossrefGoogle Scholar
  • Shapiro A., Homem-de-Mello T. On rate of convergence of Monte Carlo approximations of stochastic programs. SIAM J. Optim. (2000) 11:70–86CrossrefGoogle Scholar
  • Shapiro A., Wardi Y. Convergence analysis of stochastic algorithms. Math. Oper. Res. (1996) 21:615–628LinkGoogle Scholar
  • Shapiro A., Xu H. Stochastic mathematical programs with equilibrium constraints, modeling and sample average approximation. (2005) . http://www.optimization-online.org/DB_HTML/2005/01/1046.htmlGoogle Scholar
  • Wets R. J.-B., Nemhauser G. L., Rinnooy Kan A. H. G., Todd M. J. Stochastic programming. Handbooks in OR & MS (1989) 1(North-Holland Publishing Company, Amsterdam, The Netherlands) 573–629Google Scholar
  • Xu H. An MPCC approach for stochastic Stackelberg-Nash-Cournot equilibrium. Optimization (2005) 54:27–57CrossrefGoogle Scholar
  • Xu H. An implicit programming approach for a class of stochastic mathematical programs with complementarity constraints. SIAM J. Optim. (2006) 16:670–696CrossrefGoogle Scholar
  • Xu H., Rubinov A. M., Glover B. M. Continuous approximations to generalized Jacobians. Optimization (1999) 46:221–246CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.