Laws of large numbers for the annealing algorithm
In this paper we establish a weak and a strong law of large numbers for the algorithm of simulated annealing. To this end, we recall laws of large numbers for time-inhomogeneous Markov chains which are formulated in terms of Dobrushin's contraction coefficients, and we show how they lead to corresponding cooling constants in the annealing algorithm.
| Year of publication: |
1990
|
|---|---|
| Authors: | Gantert, Nina |
| Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 35.1990, 2, p. 309-313
|
| Publisher: |
Elsevier |
| Keywords: | simulated annealing time-inhomogeneous Markov chains law of large numbers |
Saved in:
Saved in favorites
Similar items by person
-
A note on logarithmic tail asymptotics and mixing
Gantert, Nina, (2000)
-
On slowdown and speedup of transient random walks in random environment
Fribergh, Alexander, (2010)
-
Deviations of a random walk in a random scenery with stretched exponential tails
Gantert, Nina, (2006)
- More ...