Cycle decompositions and simulated annealing

被引：32

作者：

Trouve, A

机构：

[1] Lab. Mathematiques l'Ecl. Normale S., URA 732, Ecole Normale Supérieure, 75230, Paris Cedex 05

来源：

SIAM JOURNAL ON CONTROL AND OPTIMIZATION | 1996年 / 34卷 / 03期

关键词：

cycle decomposition; large deviations; generalized simulated annealing; rate of convergence;

D O I：

10.1137/S0363012993258586

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：966 / 986

页数：21

共 14 条

[1]

Azencott R., 1992, SIMULATED ANNEALING

[2] ROUGH LARGE DEVIATION ESTIMATES FOR SIMULATED ANNEALING - APPLICATION TO EXPONENTIAL SCHEDULES [J].