Simulated Stochastic Approximation Annealing for Global Optimization With a Square-Root Cooling Schedule

• 成果类型: Article
• 署名作者: Liang, Faming; Cheng, Yichen; Lin, Guang
• 署名单位: Texas A&M University System; Texas A&M University College Station; United States Department of Energy (DOE); Pacific Northwest National Laboratory
• 刊物名称: JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION
• ISSN/ISSBN: 0162-1459
• DOI: 10.1080/01621459.2013.872993
• 发表日期: 2014
• 页码: 847-863
• 关键词: monte-carlo algorithm; CONVERGENCE; efficient; STABILITY; range; MODEL

摘要

Simulated annealing has been widely used in the solution of optimization problems. As known by many researchers, the global optima cannot be guaranteed to be located by simulated annealing unless a logarithmic cooling schedule is used. However, the logarithmic cooling schedule is so slow that no one can afford to use this much CPU time. This article proposes a new stochastic optimization algorithm, the so-called simulated stochastic approximation annealing algorithm, which is a combination of simulated annealing and the stochastic approximation Monte Carlo algorithm. Under the framework of stochastic approximation, it is shown that the new algorithm can work with a cooling schedule in which the temperature can decrease much faster than in the logarithmic cooling schedule, for example, a square-root cooling schedule, while guaranteeing the global optima to be reached when the temperature tends to zero. The new algorithm has been tested on a few benchmark optimization problems, including feed-forward neural network training and protein-folding. The numerical results indicate that the new algorithm can significantly outperform simulated annealing and other competitors. Supplementary materials for this article are available online.