Simple conditions for the convergence of simulated annealing type algorithms

Simple conditions for the convergence of simulated annealing type algorithms

0.00 Avg rating0 Votes
Article ID: iaor20002945
Country: United Kingdom
Volume: 35
Issue: 4
Start Page Number: 885
End Page Number: 892
Publication Date: Dec 1998
Journal: Journal of Applied Probability
Authors: ,
Keywords: optimization: simulated annealing
Abstract:

We study a class of simulated annealing type algorithms for global minimization with general acceptance probabilities. This paper presents simple conditions, easy to verify in practice, which ensure the convergence of the algorithm to the global minimum with probability 1.

Reviews

Required fields are marked *. Your email address will not be published.