Finite-Time Behavior of Slowly Cooled Annealing Chains

DOI10.1017/S0269964800004733MaRDI QIDQ5488522zbMATH OpenOpenAlexFDO

Authors Madhav P. Desai, Vasant B. Rao

Publication date 22 September 2006

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0269964800004733

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• Analysis of finite length annealing schedules
• scientific article; zbMATH DE number 109596
• Asymptotical behaviour of several interacting annealing processes
• scientific article; zbMATH DE number 1304351
• An improved annealing method and its large-time behavior

Cites work

• scientific article; zbMATH DE number 3678541 (Why is no real title available?)
• scientific article; zbMATH DE number 3523640 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3257775 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
• Convergence and finite-time behavior of simulated annealing
• Cooling Schedules for Optimal Annealing
• Eigenvalues and expanders
• Geometric bounds for eigenvalues of Markov chains
• Markov Chains with Rare Transitions and Simulated Annealing
• Nonstationary Markov chains and convergence of the annealing algorithm
• On Eigenvalues and Annealing Rates
• On the Convergence of Reversible Markov Chains
• Optimization by simulated annealing
• Simulated annealing via Sobolev inequalities
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• The time complexity of maximum matching by simulated annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited in

(2)

• scientific article; zbMATH DE number 774032 (Why is no real title available?)
• Some results characterizing the finite time behaviour of the simulated annealing algorithm.

This page was built for publication: Finite-Time Behavior of Slowly Cooled Annealing Chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488522)