Simulation-based optimization with stochastic approximation using common random numbers

• 成果类型: Article
• 署名作者: Kleinman, NL; Spall, JC; Naiman, DQ
• 署名单位: Johns Hopkins University; Johns Hopkins University Applied Physics Laboratory; Johns Hopkins University
• 刊物名称: MANAGEMENT SCIENCE
• ISSN/ISSBN: 0025-1909
• DOI: 10.1287/mnsc.45.11.1570
• 发表日期: 1999
• 页码: 1570-1578
• 关键词: Common Random Numbers; simultaneous perturbation stochastic approximation (SPSA); Finite Difference Stochastic Approximation (FDSA); discrete event dynamic systems

摘要

The method of Common Random Numbers is a technique used to reduce the variance of difference estimates in simulation optimization problems. These differences are commonly used to estimate gradients of objective functions as part of the process of determining optimal values for parameters of a simulated system. asymptotic results exist which show that using the Common Random Numbers method in the iterative Finite Difference Stochastic Approximation optimization algorithm (FDSA) can increase the optimal rate of convergence of the algorithm from the typical rate of k(-1/3) to the faster k(-1/2), where k is the algorithm's iteration number. Simultaneous Perturbation Stochastic Approximation (SPSA) is a newer and often much more efficient optimization algorithm, and we will show that this algorithm, too, converges faster when the Common Random Numbers method is used. We will also provide multivariate asymptotic covariance matrices for both the SPSA and FDSA errors.