Simulated annealing with time-dependent energy function via Sobolev inequalities

Stochastic Processes and their Applications

Volumn 63, Issue 2, 1996, Pages 221-233

  Löwe, Matthias ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Markov processes; Simulated annealing; Sobolev inequalities; Spectral gap

Indexed keywords

EID: 0030295649     PISSN: 03044149     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-4149(96)00070-1     Document Type: Article

References (21)

1. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines (Wiley, New York, 1989).
2. O. Catoni, Large deviations for annealing algorithms, Ph.D. Thesis (Université Paris-Sud, Orsey, 1990).
3. 2-convergence of time non-homogeneous Markov processes I: spectral estimates, Ann. Appl. Probab. 4 (1994) 1012-1056.
4. P. Diaconis and D. Stroock, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab. 1 (1991) 36-61.
5. J.A. Fill, Eigenvalue bounds on convergence to stationarity for non-reversible Markov chains, with an application to exclusion processes, Ann. Appl. Probab. 1 (1991) 62-87.
6. M.I. Freidlin and A.D. Wentzell, Random Perturbations of Dynamical Systems, Grundlehren d. math. Wissenschaften 260 (Springer, Berlin, 1984).
7. A. Frigerio and G. Grillo, Simulated annealing with time-dependent energy function, Math. Z. 213 (1993) 97-116.
8. S. Geman and D. Geman, Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images, IEEE Trans. Pattern Anal. Machine Intelligence PAMI-6 (1984) 721-741.
9. B. Gidas, Nonstationary chains and the convergence of the annealing algorithm, J. Statist. Phys. 39 (1985) 73-131.
10. F. Götze, Rate of convergence for simulated annealing processes, Preprint 92-008, SFB 343, Bielefeld (1992).
11. B. Hajek, Cooling schedules for optimal annealing, Math. Oper. Res. 13 (1988) 311-329.
12. L. van Hemmen and R. Kühn, Collective phenomena in neural networks, in: E. Domany, L. v. Hemmen and R. Schulte, eds., Models of Neural Networks (Springer, Berlin, 1991), pp. 1-105.
13. J. Holland, Adaption in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, 1975).
14. R. Holley and D. Stroock, Simulated annealing via Sobolev inequalities, Comm. Math. Phys. 115 (1988) 553-569.
15. J.J. Hopfield, Neural networks and physical systems with emergent collective computational abilities; Proc. Nat. Acad. Sci. USA 79 (1982) 2554-2558.
16. R. Horn and C. Johnson, Matrix analysis (Cambridge Univ. Press, Cambridge, 1985).
17. S. Kirkpatrick, C. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 621-680.
18. M. Löwe, On the convergence of genetic algorithms, Expo. Math., to appear.
19. D. Mitra, F. Romeo and A. Sangiovanni-Vincentelli, Convergence and finite time behavior of simulated annealing, Proc. 24th Conf. Dec. Control (1985) 761-767.
20. M. Talagrand, Résultats rigoureux pour le modèle de Hopfield, C.R. Acad. Sci. 321 (1995) 309-312.
21. R.V.V. Vidal, ed., Applied Simulated Annealing, Lecture Notes in Economics and Math. Syst. 369 (Springer, Berlin, 1993).