Some results characterizing the finite time behaviour of the simulated annealing algorithm.
From MaRDI portal
Publication:5955822
DOI10.1007/BF02823146zbMath1075.90566OpenAlexW2033302300MaRDI QIDQ5955822
Publication date: 18 February 2002
Published in: Sādhanā (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02823146
Related Items (4)
From simulated annealing to stochastic continuation: a new trend in combinatorial optimization ⋮ Stochastic approximation algorithms: overview and recent trends. ⋮ Analysis of static simulated annealing algorithms ⋮ Performance analysis of cyclical simulated annealing algorithms
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
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Computing the stationary distribution for infinite Markov chains
- Sharp large deviations estimates for simulated annealing algorithms
- Applications of sharp large deviations estimates to optimal cooling schedules
- Rough large deviation estimates for simulated annealing: Application to exponential schedules
- A limit theorem for a class of inhomogeneous Markov processes
- 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
- Balance of Recurrece Order in Time-Inhomogenous Markov Chains with Application to Simulated Annealing
- 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
- Asymptotic First Hitting-Time Distribution of Annealing Processes
- The time complexity of maximum matching by simulated annealing
- Equation of State Calculations by Fast Computing Machines
- Finite-Time Behavior of Slowly Cooled Annealing Chains
This page was built for publication: Some results characterizing the finite time behaviour of the simulated annealing algorithm.
