Model-Based Annealing Random Search with Stochastic Averaging
Abstract
The model-based methods have recently found widespread applications in solving hard nondifferentiable optimization problems. These algorithms are population-based and typically require hundreds of candidate solutions to be sampled at each iteration. In addition, recent convergence analysis of these algorithms also stipulates a sample size that increases polynomially with the number of iterations. In this article, we aim to improve the efficiency of model-based algorithms by reducing the number of candidate solutions generated per iteration. This is carried out through embedding a stochastic averaging procedure within these methods to make more efficient use of the past sampling information. This procedure not only can potentially reduce the number of function evaluations needed to obtain high-quality solutions, but also makes the underlying algorithms more amenable for parallel computation. The detailed implementation of our approach is demonstrated through an exemplary algorithm instantiation called Model-based Annealing Random Search with Stochastic Averaging (MARS-SA), which maintains the per iteration sample size at a small constant value. We establish the global convergence property of MARS-SA and provide numerical examples to illustrate its performance.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Aug 13, 2014
- Source ID
- 10.1145/2641565
Entities
People
- Enlu Zhou
- Jiaqiao Hu
- Qi Hua Fan
Organizations
- Air Force Office of Scientific Research
- Division of Civil, Mechanical & Manufacturing Innovation
- Georgia Tech
- Stony Brook University