Convergence of Stationary Points of Sample Average Two-Stage Stochastic Programs: A Generalized Equation Approach

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

References

  • Artstein Z., Vitale R. A. A strong law of large numbers for random compact sets. Ann. Probab. (1975) 3(5):879–882CrossrefGoogle Scholar
  • Aubin J.-P., Frankowska H.Set-Valued Analysis (1990) (Birkhauser, Boston) Google Scholar
  • Aumann R. J. Integrals of set-valued functions. J. Math. Anal. Appl. (1965) 12:1–12CrossrefGoogle Scholar
  • Berge C.Topological Spaces (1963) (Macmillan, New York) Google Scholar
  • Birge J., Louveaux F.Introduction to Stochastic Programming (1997) (Springer-Verlag, New York) Springer Series in Operations ResearchGoogle Scholar
  • Bonnans J. F., Shapiro A.Perturbation Analysis of Optimization Problems (2000) (Springer-Verlag, New York) Springer Series in Operations ResearchCrossrefGoogle Scholar
  • Castaing C., Valadier M.Convex Analysis and Measurable Multifunctions (1977) 580(Springer, Berlin) Lecture Notes in MathematicsCrossrefGoogle Scholar
  • Clarke F. H.Optimization and Nonsmooth Analysis (1983) (Wiley, New York) Google Scholar
  • Dai L., Chen C. H., Birge J. R. Convergence properties of two stage stochastic programming. J. Optim. Theory Appl. (2000) 106(3):489–509CrossrefGoogle Scholar
  • Dembo A., Zeitouni O.Large Deviations Techniques and Applications (1998) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • DeMiguel V., Xu H. A stochastic multiple leader Stackelberg model: Analysis, computation, and application. Oper. Res. (2009) 57(5):1220–1235LinkGoogle Scholar
  • Dontchev A. L., Lewis A. S., Rockafellar R. T. The radius of metric regularity. Trans. Amer. Math. Soc. (2004) 355(2):493–517CrossrefGoogle Scholar
  • Facchinei F., Pang J.-S.Finite-Dimensional Variational Inequalities and Complementarity Problems (2003) (Springer, New York) Google Scholar
  • Gauvin J., Dubeau F. Differential properties of the marginal functions in mathematical programming. Math. Programming Stud. (1982) 19:101–119CrossrefGoogle Scholar
  • Gauvin J., Tolle J. W. Differential stability in nonlinear programming. SIAM J. Control Optim. (1977) 15(2):294–311CrossrefGoogle Scholar
  • Gürkan G., Özge A. Y., Robinson S. M. Sample-path solution of stochastic variational inequalities. Math. Programming (1999) 84(2):313–333CrossrefGoogle Scholar
  • Hess C. Set-valued integration and set-valued probability theory: An overview. Handbook of Measure Theory (2002) I and II(North-Holland, Amsterdam) 617–673CrossrefGoogle Scholar
  • Higle J. L., Sen S.Stochastic Decomposition: A Statistical Method for Large Scale Stochastic Linear Programming (1996) (Kluwer Academic Publishers, Dordrecht, The Netherlands) CrossrefGoogle Scholar
  • Hogan W. W. Point-to-set maps in mathematical programming. SIAM Rev. (1973) 15:591–603CrossrefGoogle Scholar
  • Homem-de-Mello T. On rates of convergence for stochastic optimization problems under non-independent and identically distributed sampling. SIAM J. Optim. (2008) 19(2):524–551CrossrefGoogle Scholar
  • Hu X., Ralph D. A note on sensitivity of value functions of mathematical programs with complementarity constraints. Math. Programming (2002) 93(2):265–279CrossrefGoogle Scholar
  • Ioffe A. D. On regularity concepts in variational analysis. J. Fixed Point Theory Appl. (2010) 8(2):339–363CrossrefGoogle Scholar
  • King A. J., Rockafellar R. T. Asymptotic theory for solutions in statistical estimation and stochastic programming. Math. Oper. Res. (1993) 18(1):148–162LinkGoogle Scholar
  • King A. J., Wets R. J.-B. Epi-consistency of convex stochastic programs. Stochastics Stochastics Rep. (1991) 34(1-2):83–92CrossrefGoogle Scholar
  • Kaniovski Y. M., King A. J., Wets R. J.-B. Probabilistic bounds (via large deviation) for solutions of stochastic programming problems. Ann. Oper. Res. (1995) 56(1):189–208CrossrefGoogle Scholar
  • Linderoth J., Shapiro A., Wright S. The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. (2006) 142(1):215–241CrossrefGoogle Scholar
  • Meng F., Xu H. A regularized sample average approximation method for stochastic mathematical programs with nonsmooth equality constraints. SIAM J. Optim. (2006) 17(3):891–919CrossrefGoogle Scholar
  • Nocedal J., Wright J. J.Numerical Optimization (1999) (Springer, New York) CrossrefGoogle Scholar
  • Outrata J., Römisch W. On optimization conditions for some nonsmooth optimization problems over Lp spaces. J. Optim. Theory Appl. (2005) 126(2):411–438CrossrefGoogle Scholar
  • Papageorgiou N. On the theory of Banach space valued multifunctions 1. Integration and conditional expectation. J. Multivariate Anal. (1985) 17:185–206CrossrefGoogle Scholar
  • Plambeck E. L., Fu B. R., Robinson S. M., Suri R. Sample-path optimization of convex stochastic performances functions. Math. Programming (1996) 75(2):137–176CrossrefGoogle Scholar
  • Ralph D., Dempe S. Directional derivatives of the solution of a parametric nonlinear program. Math. Programming (1995) 70(2):159–172Google Scholar
  • Robinson S. M. Generalized equations and their solutions, Part I: Basic theory, point-to-set maps and mathematical programming. Math. Programming Stud. (1979) 10:128–141CrossrefGoogle Scholar
  • Robinson S. M. Strongly regular generalized equations. Math. Oper. Res. (1980) 5(1):43–62LinkGoogle Scholar
  • Robinson S. M. Some continuity properties of polyhedral multifunctions. Math. Programming Stud. (1981) 14:206–214CrossrefGoogle Scholar
  • Robinson S. M., Bachem A., Grötschel M., Korte B. Generalized equations. Mathematical Programming: The State of the Art (1983) (Springer-Verlag, Berlin) 346–367CrossrefGoogle Scholar
  • Robinson S. M. Analysis of sample-path optimization. Math. Oper. Res. (1996) 21(3):513–528LinkGoogle Scholar
  • Rockafellar R. T., Wets R. J.-B.Variational Analysis (1998) (Springer-Verlag, Berlin) CrossrefGoogle Scholar
  • Römisch W., Schultz R. Lipschitz stability for stochastic programs with complete recourse. SIAM J. Optim. (1996) 6(2):531–547CrossrefGoogle Scholar
  • Ruszczyński A., Shapiro A., Rusczyński A., Shapiro A. Stochastic programming models. Stochastic Programming: Handbooks in OR & MS (2003) 10(North-Holland Publishing Company, Amsterdam) Google Scholar
  • Shapiro A. Asymptotic properties of statistical estimators in stochastic programming. Ann. Statist. (1989) 17(2):841–858CrossrefGoogle Scholar
  • Shapiro A. Complexity of two and multi-stage stochastic programming problems. (2005) . http://www2.isye.gatech.edu/∼ashapiro/publications.htmlGoogle Scholar
  • Shapiro A., Rusczyński A., Shapiro A. Monte Carlo sampling methods. Stochastic Programming: Handbooks in OR & MS (2003) 10(North-Holland Publishing Company, Amsterdam) Google Scholar
  • Shapiro A., Homem-de-Mello T. A simulation-based approach to two stage stochastic programming with recourse. Math. Programming (1998) 81(3):301–325CrossrefGoogle Scholar
  • Shapiro A., Homem-de-Mello T. On rate of convergence of Monte Carlo approximations of stochastic programs. SIAM J. Optim. (2000) 11(1):70–86CrossrefGoogle Scholar
  • Shapiro A., Xu H. Stochastic mathematical programs with equilibrium constraints, modeling and sample average approximation. Optimization (2008) 57(3):395–418CrossrefGoogle Scholar
  • Shapiro A., Xu H. Uniform laws of large numbers for set-valued mappings and subdifferentials of random functions. J. Math. Anal. Appl. (2007) 325(2):1390–1399CrossrefGoogle Scholar
  • Wets R. J.-B., Nemhauser G. L., et al.Stochastic Programming: Handbooks in OR & MS (1989) 1:573–629Google Scholar
  • Xu H., Meng F. Convergence analysis of sample average approximation methods for a class of stochastic mathematical programs with equality constraints. Math. Oper. Res. (2007) 32(3):648–668LinkGoogle Scholar
  • Xu H., Zhang D. Smooth sample average approximation of stationary points in nonsmooth stochastic problems and applications. Math. Programming Ser. A (2009) 119(2):371–401CrossrefGoogle Scholar
  • Xu H., Zhang D. Stochastic Nash equilibrium problems: Sample average approximation and applications. Optimization (2009) . onlineGoogle 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.