Finite-Time Behavior of Slowly Cooled Annealing Chains

DOI10.1017/S0269964800004733zbMath1096.65502OpenAlexW2121892210MaRDI QIDQ5488522

Vasant B. Rao, Madhav P. Desai

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)

Related Items

Some results characterizing the finite time behaviour of the simulated annealing algorithm.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Geometric bounds for eigenvalues of Markov chains
• Nonstationary Markov chains and convergence of the annealing algorithm
• Simulated annealing via Sobolev inequalities
• Eigenvalues and expanders
• Approximate counting, uniform generation and rapidly mixing Markov chains
• On the Convergence of Reversible Markov Chains
• Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Convergence and finite-time behavior of simulated annealing
• Cooling Schedules for Optimal Annealing
• On Eigenvalues and Annealing Rates
• Markov Chains with Rare Transitions and Simulated Annealing
• The time complexity of maximum matching by simulated annealing