A convergence analysis of generalized hill climbing algorithms

Authors
Sullivan, KA Jacobson, SH
Citation
Ka. Sullivan et Sh. Jacobson, A convergence analysis of generalized hill climbing algorithms, IEEE AUTO C, 46(8), 2001, pp. 1288-1293
Citations number
16
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
ISSN journal
00189286 → ACNP
Volume
46
Issue
8
Year of publication
2001
Pages
1288 - 1293
Database
ISI
SICI code
0018-9286(200108)46:8<1288:ACAOGH>2.0.ZU;2-E
Abstract
Generalized hill climbing (GHC) algorithms provide a well-defined framework for describing the performance of local search algorithms for discrete opt imization problems. Necessary and sufficient convergence conditions for GHC algorithms are presented. These convergence conditions are derived using a new iteration classification scheme for GHC algorithms. The implications o f the necessary and the sufficient convergence conditions for GHC algorithm s with respect to existing convergence theory for simulated annealing are a lso discussed.