Note on the Convergence of Simulated Annealing Algorithms
Copyright policy )Note on the Convergence of Simulated Annealing Algorithms
Generalizing the results of the first author and \textit{R. Schrader} [Inf. Process. Lett. 27, 189-194 (1988; Zbl 0638.65054)] a short inductive proof is given that shows that the stationary distributions of a simulated annealing algorithm converge to a distribution where nonoptimal elements are generated with probability zero, provided that the ``weak reversibility condition'' of \textit{B. Hajek} [Math. Oper. Res. 13, No. 2, 311-329 (1988; Zbl 0652.65050)] holds.
- University of Twente Netherlands
stationary distributions of a simulated annealing algorithm, weak reversibility condition, Combinatorial optimization, inductive proof, Computational methods for problems pertaining to operations research and mathematical programming
stationary distributions of a simulated annealing algorithm, weak reversibility condition, Combinatorial optimization, inductive proof, Computational methods for problems pertaining to operations research and mathematical programming
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).21 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!