Necessary and sufficient conditions for success of the metropolis algorithm for optimization

Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Volumn , Issue , 2010, Pages 1417-1424

  Sanyal, Swagato ^a   Raja, S ^a   Biswas, Somenath ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

Metropolis algorithm; Optimization; Rapid mixing of markov chains; Success of markov chain families

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; ERGODICS; FLOW OUT; MARKOV CHAIN; METROPOLIS ALGORITHMS; OPTIMIZATION PROBLEMS; RAPID MIXING; SUFFICIENT CONDITIONS;

CHARACTERIZATION; COMBINATORIAL OPTIMIZATION; MARKOV PROCESSES;

ALGORITHMS;

EID: 77955894086     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830483.1830744     Document Type: Conference Paper

References (6)

1. M. Jerrum andG. B. Sorkin. Simulated Annealing for Graph Bisection. In Proc. Symp. on Foundations of Computer Science, pages 94-103, 1993.
2. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, andE. Teller. Equations of state calculations by fast computing machines. Journal of Chemical Physics, 21: 1087-1092, 1953.
3. G. Sasaki. The Effect of the Density of States on the Metropolis algorithm. Information Processing Letters, 37(5): 158-163, 1991.
4. G. H. Sasaki andB. Hajek. The Time Complexity of Maximum Matching by Simulated Annealing. Journal of the ACM (JACM), 35(2): 387-403, 1988.
5. A. Sinclair. Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkháuser Verlag, 1993.
6. I. Wegener. Simulated Annealing Beats Metropolis in Combinatorial Optimization. In International Colloquium on Automata, Languages and Programming, 2005.