Laws of large numbers for the annealing algorithm (Q751733): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q401423
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Tadeusz Inglot / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonstationary Markov chains and convergence of the annealing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4098444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3242474 / rank
 
Normal rank

Latest revision as of 12:03, 21 June 2024

scientific article
Language Label Description Also known as
English
Laws of large numbers for the annealing algorithm
scientific article

    Statements

    Laws of large numbers for the annealing algorithm (English)
    0 references
    0 references
    1990
    0 references
    A convergence of the algorithm of simulated annealing is considered. First, an error in the paper of \textit{B. Gidas} [J. Stat. Phys. 39, 73-131 (1985; Zbl 0642.60049)] is pointed out. Next, well-known laws of large numbers for time-inhomogeneous Markov chains are applied. Assumptions formulated in terms of Dobrushin contraction coefficients lead to appropriate cooling constant. Namely, in the cooling scheme \(\beta (n)=\gamma \log n\) weak LLN holds for \(\gamma <\gamma_ 0\) and strong LLN holds for \(\gamma <\gamma_ 0/2\) with some given \(\gamma_ 0\).
    0 references
    simulated annealing
    0 references
    laws of large numbers for time-inhomogeneous Markov chains
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references