Cycle Decompositions and Simulated Annealing
Author:
- Alain TrouvéATAlain Trouvé
- 1 May 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 34 (3) , 966-986
Abstract
The behavior of simulated annealing algorithms is tightly related to the hierarchical decomposition of their configuration spaces in cycles. In the generalized annealing framework, this decomposition is defined recursively. In this paper, its structure is extensively studied, and it is shown that the decomposition can be achieved through an implementable algorithm which allows exact computation of the fundamental constants underlying the behavior of these algorithms.Keywords
This publication has 8 references indexed in Scilit:
- Asymptotic behavior of eigenvalues and random updating schemesApplied Mathematics & Optimization, 1993
- Rough Large Deviation Estimates for Simulated Annealing: Application to Exponential SchedulesThe Annals of Probability, 1992
- Singular perturbed Markov chains and exact behaviors of simulated annealing processesJournal of Theoretical Probability, 1992
- Large-time behavior of perturbed diffusion markov processes with applications to the second eigenvalue problem for fokker-planck operators and simulated annealingActa Applicandae Mathematicae, 1990
- A Limit Theorem for a Class of Inhomogeneous Markov ProcessesThe Annals of Probability, 1989
- Cooling Schedules for Optimal AnnealingMathematics of Operations Research, 1988
- Random Perturbations of Dynamical Systems1984
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972