The effect of the density of states on the Metropolis algorithm

DOI10.1016/0020-0190(91)90037-IMaRDI QIDQ750154zbMATH OpenOpenAlexFDO

Authors Galen Sasaki

Publication date 1991

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90037-i

zbMATH Keywords

Markov chainperformance evaluationrandom local searchsimulated annealing

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Mathematical programming (90C99)

Recommendations

• Automata, Languages and Programming
• scientific article; zbMATH DE number 953296
• Optimization by simulated annealing
• Metropolis, simulated annealing, and iterated energy transformation algorithms: Theory and experiments
• Simulated annealing versus Metropolis for a TSP instance

Cites work

• Cooling Schedules for Optimal Annealing
• Equation of state calculations by fast computing machines
• Optimization by simulated annealing
• The time complexity of maximum matching by simulated annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited in

(7)

• The Metropolis algorithm for graph bisection
• Multipath metropolis simulation: an application to the classical Heisenberg model
• An algorithm derived from the Metropolis algorithm
• Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm
• It's puzzling
• Automata, Languages and Programming
• Time lower bounds for the Metropolis process and simulated annealing

This page was built for publication: The effect of the density of states on the Metropolis algorithm

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