Variable-sample methods for stochastic optimization

In this article we discuss the application of a certain class of Monte Carlo methods to stochastic optimization problems. Particularly, we study variable-sample techniques, in which the objective function is replaced, at each iteration, by a sample average approximation. We first provide general results on the schedule of sample sizes, under which variable-sample methods yield consistent estimators as well as bounds on the estimation error. Because the convergence analysis is performed pathwisely, we are able to obtain our results in a flexible setting, which requires mild assumptions on the distributions and which includes the possibility of using different sampling distributions along the algorithm. We illustrate these ideas by studying a modification of the well-known pure random search method, adapting it to the variable-sample scheme, and show conditions for convergence of the algorithm. Implementation issues are discussed and numerical results are presented to illustrate the ideas.

[1]  Kai Lai Chung,et al.  A Course in Probability Theory , 1949 .

[2]  Luc Devroye,et al.  Progressive global random search of continuous functions , 1978, Math. Program..

[3]  M. Rao.  Probability theory with applications , 1984 .

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

[5]  S. Mitter,et al.  Simulated annealing with noisy or imprecise energy measurements , 1989 .

[6]  C. Dorea.  Stopping rules for a random optimization method , 1990 .

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

[8]  Yu-Chi Ho,et al.  Ordinal optimization of DEDS , 1992, Discret. Event Dyn. Syst..

[9]  Weibo Gong,et al.  Stochastic comparison algorithm for discrete optimization with estimation , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[10]  D. Yan,et al.  Stochastic discrete optimization , 1992 .

[11]  C. Dorea,et al.  Alternative sampling strategy for a random optimization algorithm , 1993 .

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

[13]  Charles Leake,et al.  Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method , 1994 .

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

[15]  B. Fox,et al.  Probabilistic Search with Overrides , 1995 .

[16]  S. Andradóttir.  A method for discrete stochastic optimization , 1995 .

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

[18]  Sigrún Andradóttir,et al.  A Global Search Method for Discrete Stochastic Optimization , 1996, SIAM J. Optim..

[19]  Georg Ch. Pflug,et al.  Simulated Annealing for noisy cost functions , 1996, J. Glob. Optim..

[20]  Günter Rudolph,et al.  Convergence of evolutionary algorithms in general search spaces , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

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

[22]  R. K. Wood,et al.  On a stochastic knapsack problem and generalizations , 1997 .

[23]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[24]  A. Shapiro,et al.  On rate of convergence of Monte Carlo approximations of stochastic programs , 1998 .

[25]  William E. Hart.  Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search , 1998, SIAM J. Optim..

[26]  Alexander Shapiro,et al.  A simulation-based approach to two-stage stochastic programming with recourse , 1998, Math. Program..

[27]  Barry L. Nelson,et al.  Accounting for Randomness in Heuristic Simulation Optimization , 1998, ESM.

[28]  Georg Ch. Pflug,et al.  A branch and bound method for stochastic global optimization , 1998, Math. Program..

[29]  Alexander Shapiro,et al.  Finding Optimal Material Release Times Using Simulation-Based Optimization , 1999 .

[30]  S. Andradóttir,et al.  A Simulated Annealing Algorithm with Constant Temperature for Discrete Stochastic Optimization , 1999 .

[31]  Yu-Chi Ho,et al.  Stochastic Comparison Algorithm for Discrete Optimization with Estimation , 1999, SIAM J. Optim..

[32]  Alexander Shapiro,et al.  On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs , 2000, SIAM J. Optim..

[33]  Pierre L'Ecuyer,et al.  Global Stochastic Optimization with Low-Dispersion Point Sets , 1998, Oper. Res..

[34]  Tito Homem-de-Mello,et al.  Monte Carlo Methods for Discrete Stochastic Optimization , 2001 .

[35]  Mahmoud H. Alrefaei,et al.  A modification of the stochastic ruler method for discrete stochastic optimization , 2001, Eur. J. Oper. Res..

[36]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[37]  Walter J. Gutjahr,et al.  ACO algorithms with guaranteed convergence to the optimal solution , 2002, Inf. Process. Lett..

[38]  William L. Cooper,et al.  CONVERGENCE OF SIMULATION-BASED POLICY ITERATION , 2003, Probability in the Engineering and Informational Sciences.