Convergence theorems for a class of simulated annealing algorithms on ℝd
- 1 December 1992
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 29 (4) , 885-895
- https://doi.org/10.2307/3214721
Abstract
We study a class of simulated annealing algorithms for global minimization of a continuous function defined on a subset ofWe consider the case where the selection Markov kernel is absolutely continuous and has a density which is uniformly bounded away from 0. This class includes certain simulated annealing algorithms recently introduced by various authors. We show that, under mild conditions, the sequence of states generated by these algorithms converges in probability to the global minimum of the function. Unlike most previous studies where the cooling schedule is deterministic, our cooling schedule is allowed to be adaptive. We also address the issue of almost sure convergence versus convergence in probability.Keywords
This publication has 8 references indexed in Scilit:
- Hit-and-Run Algorithms for Generating Multivariate DistributionsMathematics of Operations Research, 1993
- Global optimization and simulated annealingMathematical Programming, 1991
- Simulated annealing: An introductionStatistica Neerlandica, 1989
- Cooling Schedules for Optimal AnnealingMathematics of Operations Research, 1988
- Hit-and-run algorithms for the identification of nonredundant linear inequalitiesMathematical Programming, 1987
- A tutorial survey of theory and applications of simulated annealingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Nonstationary Markov chains and convergence of the annealing algorithmJournal of Statistical Physics, 1985
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984