Adaptive Random Search for Continuous Simulation Optimization

作者：Andradottir Sigrun^*; Prudius Andrei A

来源：Naval Research Logistics, 2010, 57(6): 583-604.

DOI：10.1002/nav.20422

• continuous stochastic optimization
• local search
• pure random search
• global convergence in probability and almost surely
• adaptive search with resampling
• deterministic and stochastic shrinking ball methods

We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely. and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small.

• 出版日期2010-9