Finite-Time Behavior of Slowly Cooled Annealing Chains
From MaRDI portal
Publication:5488522
DOI10.1017/S0269964800004733zbMATH Open1096.65502OpenAlexW2121892210MaRDI QIDQ5488522FDOQ5488522
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
Recommendations
Cites Work
- Optimization by simulated annealing
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Eigenvalues and expanders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simulated annealing via Sobolev inequalities
- Geometric bounds for eigenvalues of Markov chains
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Cooling Schedules for Optimal Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Title not available (Why is that?)
- 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
- Nonstationary Markov chains and convergence of the annealing algorithm
- On Eigenvalues and Annealing Rates
- The time complexity of maximum matching by simulated annealing
- On the Convergence of Reversible Markov Chains
- Markov Chains with Rare Transitions and Simulated Annealing
Cited In (2)
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)