On simulated annealing with temperature-dependent energy and temperature-dependent communication
Simulated annealing (SA) is a generic optimization method that is quite popular because of its ease of implementation and its optimal convergence properties. Still, SA is widely reported to converge very slowly and it is common practice to allow extra freedom in its design at the expense of losing global convergence guarantees. In this paper, we derive simple sufficient conditions for the global convergence of SA when the cost function and the candidate solution generation mechanism are temperature-dependent. These conditions are surprisingly weak-they do not involve the variations of the cost function with temperature-and exponential cooling makes it possible to be arbitrarily close to the best possible convergence exponent of standard SA.
Year of publication: |
2011
|
---|---|
Authors: | Robini, Marc C. ; Reissman, Pierre-Jean |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 81.2011, 8, p. 915-920
|
Publisher: |
Elsevier |
Keywords: | Combinatorial optimization Simulated annealing Markov chains Monte Carlo methods |
Saved in:
Saved in favorites
Similar items by person
-
From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
Robini, Marc C., (2013)
-
From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
Robini, Marc, (2013)
-
On the Convergence of Metropolis-Type Relaxation and Annealing with Constraints
Robini, Marc C., (2018)
- More ...