Convergence of an annealing algorithm

Mathematical Programming

Volumn 34, Issue 1, 1986, Pages 111-124

  Lundy, M ^a   Mees, A ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Annealing; Global Optimization; Hill Climbing; Local Improvement; Metropolis Method; NP; Stochastic Optimization

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL TECHNIQUES - COMBINATORIAL MATHEMATICS;

ANNEALING ALGORITHM; GLOBAL OPTIMIZATION; HILL CLIMBING; METROPOLIS METHOD; STOCHASTIC OPTIMIZATION;

OPTIMIZATION;

EID: 0022463446     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01582166     Document Type: Article

References (18)

1. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images
2. Applications of the annealing algorithm to combinatorial problems in statistics
3. Equation of state calculation by fast computing machines
4. The method of minimum evolution
5. On the number of iterations of local improvement algorithms