Metropolis, simulated annealing, and iterated energy transformation algorithms: Theory and experiments

Journal of Complexity

Volumn 12, Issue 4, 1996, Pages 595-623

  Catoni, Olivier ^a  

^a ÉCOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030498362     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1996.0035     Document Type: Article

References (29)

1. 1. AZENCOTT, R. (1988), Simulated annealing, in "Séminaire Bourbaki 4 Oiéme année, 1987-1988," Vol. 697.
2. 2. AZENCOTT, R. (1992), Sequential simulated annealing: Speed of convergence and acceleration techniques, in "Simulated Annealing: Parallelization Techniques" (R. Azencott, Ed.), Chap. 1, Wiley-Interscience, New York.
3. 3. AZENCOTT, R., AND GRAFFIGNE, C. (1992), Parallel annealing by periodically interacting multiple searches: Acceleration rates, in "Simulated Annealing: Parallelization Techniques" (R. Azencott, Ed.), Chap. 1, Wiley-Interscience, New York.
4. 4. CATONI, O., AND CERF, R. (1995), The exit path of a Markov chain with rare transitions, preprint, available at http://www.dmi.ens.fr; ESAIM:-P&S, to appear; http://www.emath.fr/ Maths/Ps/ps.html.
5. 5. CATONI, O. (1992), Rough large deviation estimates for simulated annealing: Application to exponential schedules, Ann. Probab. 20, 1109-1146.
6. 6. CATONI, O. (1994), The energy transformation method for the Metropolis algorithm compared with simulated annealing, preprint, rapport de recherche du LMENS; Prob. Th. Rel. Fields, to appear.
7. 7. CATONI, O. (1991), Exponential triangular cooling schedules for simulated annealing algorithms: A case study, "Applied Stochastic Analysis, Proceedings of a US-French Workshop, Rutgers University, April 29-May 2, 1991" (I. Karatzas and D. Ocone, Eds), Lecture Notes in Control and Information Sciences, Vol. 177, Springer-Verlag, Berlin/ New York, 1992.
8. 8. CATONI, O. (1995), Algorithmes de recuit simulé et chaînes de Markov à transitions rares, D.E. A. lecture notes, Modélisation stochastique et Statistique, Université Paris XI-Orsay.
9. 9. CATONI, O. (1996), Solving scheduling problems by simulated annealing, preprint, research report of the LMENS, available at http://www.dmi.ens.fr.
10. 10. CHIANG, T. S., AND CHOW, Y. (1989), A limit theorem for a class of inhomogeneous Markov processes, Ann. Probab. 17, 1483-1502.
11. 11. CHIANG, T. S., AND CHOW, Y. (1995), On the exit problem from a cycle of simulated annealing processes, Tech Rep. Inst. Math. Academia Sinica.
12. 12. COT, C., AND CATONI, O. (1996), Piecewise constant triangular cooling schedules for generalized simulated annealing algorithms, preprint, research report 96-19 of the L.M.E.N.S., available at http://www.dmi.ens.fr/dmi/preprints.
13. 2 convegence of time nonhomogeneous Markov processes. I. Spectral estimates, Ann. Appl. Probab. 4, 1012-1056.
14. 14. DIACONIS, P., AND STROOCK, D. (1991), Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab. 1, 36-61.
15. 15. FREIDLIN, M. I., AND WENTZELL, A. D. (1984), "Random Perturbations of Dynamical Systems," Springer, New York.
16. 16. GAREY, M. R., AND JOHNSON, D. S. (1979), "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, New York.
17. 17. GEMAN, D., AND GEMAN, S. (1984), Stochasticrelaxation, Gibbs distribution, and the Bayesian restoration of images, IEEE Trans. Pattern Anal. Machine Intelligence 6, 721-741, 1984.
18. 18. GÖTZE, F. (1991), Rate of convergence of simulated annealing processes, preprint.
19. 19. GRAFFIGNE, C. (1992), Parallel annealing by periodically interacting multiple searches: An experimental study, in "Simulated Annealing: Parallelization Techniques," (R. Azencott, Ed), Chap. 1, Wiley-Interscience, New York.
20. 20. HOLLEY, R., AND STROOCK, D. (1988), Annealing via Sobolev inequalities, Comm. Math. Phys. 115, 553-559.
21. 21. HWANG, C. R., AND SHEU, S. J. (1992), Singular perturbed Markov chains and exact behaviour of simulated annealing processes, J. Theoret. Probab. 5, 223-249.
22. 22. KIRKPATRICK, S., GELATT, C. D., AND VECCHI, M. P. (1983), Optimization by simulated annealing, Science 220, 621-680.
23. 23. MICLO, L. (1991), "Evolution de I'énergie libre. Application à l'étude de la convergence des algorithmes du recuit simulé," Doctoral Dissertation, Université d'Orsay.
24. 24. MICLO, L. (1995), Sur les problèmes de sortie discrets inhomogènes, Ann. Appl. Probab., to appear.
25. 25. MICLO, L. (1995), Sur les temps d'occupations des processus de Markov finis inhomogènes à basse température, submitted for publication.
26. 26. TROUVÉ, A. (1993), "Parallélisation massive du recuit simulé," Doctoral Dissertation, Université Paris 11.
27. 27. TROUVÉ, A. (1996), Cycle decomposition and simulated annealing, SIAM J. Control Optim. 34.
28. 28. TROUVÉ, A. (1996), Rough large deviation estimates for the optimal convergence speed exponent of generalized simulated annealing algorithms, Ann. Inst. H. Poincaré Probab. Statist. 32.
29. 29. TSITSIKLIS, J. (1989), Markov chains with rare transitions and simulated annealing, Math. Oper. Res. 14, 70-90.