Simulation-based optimization—convergence analysis and statistical inference

In this paper we consider optimization problems where the objective function is not given explicitly and should be estimated, say by a Monte Carlo simulation. We discuss convergence properties and statistical inference of the so-called “stochastic counterpart” approach to such simulation-based optimization. This method is based on generation of a large sample and subsequent solution of a constructed approximation of the “true” program by deterministic methods of nonlinear programming. The required “stochastic counterpart” approximation can be constructed, for example, by the likelihood ratio-score function techniques. We discuss relative efficiency of the stochastic counterpart and stochastic approximation methods and show that for smooth unconstrained problems both methods produce asymptotically equivalent estimators provided the stochastic approximation estimators are calculated for an optimal choice of the corresponding stepsizes. We also discuss a few examples of nonsmooth and constrained problems and...

[1]  D. V. Lindley,et al.  The theory of queues with a single server , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.

[2]  K. Chung On a Stochastic Approximation Method , 1954 .

[3]  V. Fabian On Asymptotic Normality in Stochastic Approximation , 1968 .

[4]  P. Billingsley,et al.  Convergence of Probability Measures , 1969 .

[5]  M. T. Wasan Stochastic Approximation , 1969 .

[6]  R. Wets Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program , 1974 .

[7]  Kumpati S. Narendra,et al.  Adaptation and learning in automatic systems , 1974 .

[8]  Peter Kall,et al.  Stochastic Linear Programming , 1975 .

[9]  Mikhail Borisovich Nevelʹson,et al.  Stochastic Approximation and Recursive Estimation , 1976 .

[10]  Harold J. Kushner,et al.  wchastic. approximation methods for constrained and unconstrained systems , 1978 .

[11]  G. S. Fishman Principles of Discrete Event Simulation , 1978 .

[12]  Roger J.-B. Wets,et al.  Stochastic Programming: Solution Techniques and Approximation Schemes , 1982, ISMP.

[13]  F. Clarke Optimization And Nonsmooth Analysis , 1983 .

[14]  Y. Ermoliev Stochastic quasigradient methods and their application to system optimization , 1983 .

[15]  H. Attouch Variational convergence for functions and operators , 1984 .

[16]  G. Pflug Stochastic minimization with constant step-size: asymptotic laws , 1986 .

[17]  Sلأren Asmussen,et al.  Applied Probability and Queues , 1989 .

[18]  A. Shapiro Sensitivity analysis of nonlinear programs and differentiability properties of metric projections , 1988 .

[19]  Yuri Ermoliev,et al.  Stochastic programming, an introduction. Numerical techniques for stochastic optimization , 1988 .

[20]  Yuri Ermoliev,et al.  Numerical techniques for stochastic optimization , 1988 .

[21]  J. Dupacová,et al.  ASYMPTOTIC BEHAVIOR OF STATISTICAL ESTIMATORS AND OF OPTIMAL SOLUTIONS OF STOCHASTIC OPTIMIZATION PROBLEMS , 1988 .

[22]  A. W. Kemp,et al.  Applied Probability and Queues , 1989 .

[23]  A. Shapiro Asymptotic Properties of Statistical Estimators in Stochastic Programming , 1989 .

[24]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[25]  Pierre Priouret,et al.  Adaptive Algorithms and Stochastic Approximations , 1990, Applications of Mathematics.

[26]  Alexander Shapiro,et al.  Asymptotic analysis of stochastic programs , 1991, Ann. Oper. Res..

[27]  Julia L. Higle,et al.  Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse , 1991, Math. Oper. Res..

[28]  P. Dupuis,et al.  On sampling controlled stochastic approximation , 1991 .

[29]  R. Rubinstein,et al.  The efficiency and heavy traffic properties of the score function method in sensitivity analysis of queueing models , 1992, Advances in Applied Probability.

[30]  Boris Polyak,et al.  Acceleration of stochastic approximation by averaging , 1992 .

[31]  Alexander Shapiro,et al.  On optimal choice of reference parameters in the likelihood ratio method , 1992, WSC '92.

[32]  Reuven Y. Rubinstein,et al.  Sensitivity analysis of discrete event systems by the “push out” method , 1992, Ann. Oper. Res..

[33]  R. Tyrrell Rockafellar,et al.  Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming , 1993, Math. Oper. Res..

[34]  P. Glynn,et al.  Stochastic Optimization by Simulation: Convergence Proofs for the GI/G/1 Queue in Steady-State , 1994 .

[35]  E. Chong,et al.  Optimization of queues using an infinitesimal perturbation analysis-based stochastic algorithm with general update times , 1993 .

[36]  Alexander Shapiro,et al.  Asymptotic Behavior of Optimal Solutions in Stochastic Programming , 1993, Math. Oper. Res..

[37]  Werner Römisch,et al.  Stability of Solutions for Stochastic Programs with Complete Recourse , 1993, Math. Oper. Res..

[38]  A. Shapiro,et al.  Nondifferentiability of the steady-state function in discrete event dynamic systems , 1994, IEEE Trans. Autom. Control..

[39]  P. Glynn,et al.  Stochastic optimization by simulation: numerical experiments with the M / M /1 queue in steady-state , 1994 .

[40]  Jason H. Goodfriend,et al.  Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method , 1995 .

[41]  S. M. Robinson Convergence of subdifferentials under strong stochastic convexity , 1995 .

[42]  A. Shapiro,et al.  Convergence analysis of gradient descent stochastic algorithms , 1996 .

[43]  Stephen M. Robinson,et al.  Sample-path optimization of convex stochastic performance functions , 1996, Math. Program..

[44]  Yorai Wardi,et al.  Convergence Analysis of Stochastic Algorithms , 1996, Math. Oper. Res..

[45]  Stephen M. Robinson,et al.  Analysis of Sample-Path Optimization , 1996, Math. Oper. Res..