On Choosing Parameters in Retrospective-Approximation Algorithms for Stochastic Root Finding and Simulation Optimization

References

• Andradóttir S., Henderson S. G., Nelson B. L. An overview of simulation optimization via random search. Simulation. Handbooks in Operations Research and Management Science (2006) (Elsevier, Amsterdam) 617–631Google Scholar
• Atlason J., Epelman M. A., Henderson S. G. Call center staffing with simulation and cutting plane methods. Ann. Oper. Res. (2004) 127:333–358Crossref, Google Scholar
• Atlason J., Epelman M. A., Henderson S. G. Optimizing call center staffing using simulation and analytic center cutting-plane methods. Management Sci. (2008) 54(2):295–309Link, Google Scholar
• Barton R. R., Meckesheimer M., Henderson S. G., Nelson B. L. Metamodel-based simulation optimization. Simulation. Handbooks in Operations Research and Management Science (2006) (Elsevier, Amsterdam) 535–574Google Scholar
• Bastin F., Cirillo C., Toint P. L. Convergence theory for nonconvex stochastic programming with an application to mixed logit. Math. Programming (2006) 108:207–234Crossref, Google Scholar
• Bayraksan G., Morton D. P. Assessing solution quality in stochastic programs. Math. Programming Ser. B (2007) 108:495–514Crossref, Google Scholar
• Bayraksan G., Morton D. P. A sequential sampling procedure for stochastic programming. Oper. Res. (2010) . ForthcomingGoogle Scholar
• Bhatnagar S., Borkar V. S. A two time scale stochastic approximation scheme for simulation based parametric optimization. Probab. Engrg. Informational Sci. (1998) 12:519–531Crossref, Google Scholar
• Bhatnagar S., Fu M. C., Marcus S. I., Bhatnagar S. Two-timescale algorithms for simulation optimization of hidden Markov models. IIE Trans. (2001) 33:245–258Crossref, Google Scholar
• Boyd S.Convex Optimization (2004) (Cambridge University Press, Cambridge, UK) Crossref, Google Scholar
• Chen H., Schmeiser B. W. Stochastic root finding via retrospective approximation. IIE Trans. (2001) 33:259–275Crossref, Google Scholar
• Fu M. C. Optimization for simulation: Theory vs. practice. INFORMS J. Comput. (2002) 14:192–215Link, Google Scholar
• Gill P. E., Murray W., Wright M. H.Practical Optimization (1986) (Elsevier, London) Google Scholar
• Glasserman P.Gradient Estimation via Perturbation Analysis (1991) (Kluwer, Dordrecht, The Netherlands) Google Scholar
• Healy K., Schruben L. W., Nelson B. L., Kelton D. W., Clark G. M. Retrospective simulation response optimization. Proc. 1991 Winter Simulation Conf. (1991) (Institute of Electrical and Electronics Engineers, Piscataway, NJ) 954–957Crossref, Google Scholar
• Herer Y. T., Tzur M., Yucesan E. The multilocation transshipment problem. IIE Trans. (2006) 38:185–200Crossref, Google Scholar
• Higle J., Sen S. Stochastic decomposition: An algorithm for two-stage linear programs with recourse. Math. Oper. Res. (1991) 16(3):650–669Link, Google Scholar
• Homem-de-Mello T. Variable-sample methods for stochastic optimization. ACM Trans. Modeling Comput. Simulation (2003) 13:108–133Crossref, Google Scholar
• Homem-de-Mello T. On rates of convergence for stochastic optimization problems under non-i.i.d. sampling. SIAM J. Optim. (2008) 19(2):524–551Crossref, Google Scholar
• Homem-de-Mello T., Shapiro A., Spearman M. L. Finding optimal material release times using simulation-based optimization. Management Sci. (1999) 45(1):86–102Link, Google Scholar
• Kim S.-H., Nelson B. L., Henderson S. G., Nelson B. L. Selecting the best system. Simulation. Handbooks in Operations Research and Management Science (2006) (Elsevier, Amsterdam) 501–534Crossref, Google Scholar
• Kleywegt A. J., Shapiro A., Homem-de-Mello T. The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. (2001) 12:479–502Crossref, Google Scholar
• Kushner H., Clark D.Stochastic Approximation Methods for Constrained and Unconstrained Systems (1978) (Springer-Verlag, New York) Crossref, Google Scholar
• Kushner H. J., Yin G. G.Stochastic Approximation and Recursive Algorithms and Applications (2003) (Springer-Verlag, New York) Google Scholar
• Mak W. K., Morton D. P., Wood R. K. Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. (1999) 24:47–56Crossref, Google Scholar
• Nemirovski A., Shapiro A. Convex approximations of chance constrained programs. Optim. Online (2004) . http://www.optimization-online.org/Google Scholar
• Ólafsson S., Henderson S. G., Nelson B. L. Metaheuristics. Simulation. Handbooks in Operations Research and Management Science (2006) (Elsevier, Amsterdam) 633–654Crossref, Google Scholar
• Ortega J. M., Rheinboldt W. C.Iterative Solution of Nonlinear Equations in Several Variables (1970) (Academic Press, New York) Google Scholar
• Pasupathy R., Perrone L., Wieland F., Liu J., Lawson B., Nicol D., Fujimoto R. On choosing parameters in retrospective-approximation algorithms for simulation-optimization. Proc. 2006 Winter Simulation Conf. (2006) (Institute of Electrical and Electronics Engineers, Piscataway, NJ) 208–215Crossref, Google Scholar
• Pasupathy R., Schmeiser B. W. Retrospective-approximation algorithms for multidimensional stochastic root-finding problems. ACM TOMACS (2009) 19(2):5:1–5:36Crossref, Google 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–176Crossref, Google Scholar
• Polak E., Royset J. O. Efficient sample sizes in stochastic nonlinear programming. J. Comput. Appl. Math. (2008) 217(2):301–310Crossref, Google Scholar
• Prakash P., Deng G., Converse M. C., Webster J. G., Mahvi G. M., Ferris M. C. Design optimization of a robust sleeve antenna for hepatic microwave ablation. Phys. Med. Biol. (2008) 53:1057–1069Crossref, Google Scholar
• Robbins H., Monro S. A stochastic approximation method. Ann. Math. Statist. (1951) 22:400–407Crossref, Google Scholar
• Robinson S. Analysis of sample-path optimization. Math. Oper. Res. (1996) 21:513–528Link, Google Scholar
• Rubinstein R. Y., Shapiro A.Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method (1993) (John Wiley & Sons, New York) Google Scholar
• Rudin W.Principles of Mathematical Analysis (1976) (Mc-Graw Hill, New York) Google Scholar
• Shapiro A. Asymptotic analysis of stochastic programs. Ann. Oper. Res. (1991) 30:169–186Crossref, Google Scholar
• Shapiro A. Stochastic programming by Monte Carlo simulation methods. Stochastic Programming E-Print Ser. (2000) . http://hera.rz.hu-berlin.de/speps/Google Scholar
• Shapiro A., Ruszczynski A., Shapiro A. Monte Carlo sampling methods. Stochastic Programming. Handbooks in Operations Research and Management Science (2004) (Elsevier, Amsterdam) 353–426Google Scholar
• Spall J. C.Introduction to Stochastic Search and Optimization (2003) (John Wiley & Sons, Inc., Hoboken, NJ) Crossref, Google Scholar
• Spall J. C. Feedback and weighting mechanisms for improving Jacobian (Hessian) estimates in the adaptive simultaneous perturbation algorithm. Proc. Amer. Control Conf. (2006) JunePiscataway, NJCrossref, Google Scholar
• Szechtman R., Henderson S. G., Nelson B. L. A Hilbert space approach to variance reduction. Simulation. Handbooks in Operations Research and Management Science (2006) (Elsevier, Amsterdam) 259–290Crossref, Google Scholar
• Tadic V., Meyn S. P. Asymptotic properties of two time-scale stochastic approximation algorithms with constant step sizes. Proc. Amer. Control Conf. (2003) JunePiscataway, NJCrossref, Google Scholar
• Verweij B., Ahmed S., Kleywegt A., Nemhauser G., Shapiro A. The sample average approximation method applied to stochastic vehicle routing problems: A computational study. Comput. Appl. Optim. (2003) 24:289–333Crossref, Google Scholar
• Wardi Y., Melamed B., Cassandras C. G., Panayiotou C. G. On-line IPA gradient estimators in stochastic continuous fluid models. J. Optim. Theory Appl. (2002) 115(2):369–405Crossref, Google Scholar