Convergence of a Simulated Annealing Algorithm for Continuous Global Optimization

In this paper a simulated annealing algorithm for continuous global optimization will be considered. The algorithm, in which a cooling schedule based on the distance between the function value in the current point and an estimate of the global optimum value is employed, has been first introduced in Bohachevsky, Johnson and Stein (1986) [2], but without any proof of convergence. Here it will be proved that, under suitable assumptions, the algorithm is convergent

[1]  Robert L. Smith,et al.  Simulated Annealing and Adaptive Search in Global Optimization , 1994, Probability in the Engineering and Informational Sciences.

[2]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[3]  M. E. Johnson,et al.  Generalized simulated annealing for function optimization , 1986 .

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Robert L. Smith,et al.  Simulated annealing for constrained global optimization , 1994, J. Glob. Optim..

[6]  Convergence properties of simulated annealing for continuous global optimization , 1996 .

[7]  M. Locatelli.  Simulated Annealing Algorithms for Continuous Global Optimization , 2002 .

[8]  S. Mitter,et al.  Metropolis-type annealing algorithms for global optimization in R d , 1993 .

[9]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[10]  Steven G. Louie,et al.  A Monte carlo simulated annealing approach to optimization over continuous variables , 1984 .

[11]  Sandro Ridella,et al.  Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithmCorrigenda for this article is available here , 1987, TOMS.

[12]  Thomas F. Coleman,et al.  A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing , 1993, J. Glob. Optim..

[13]  M. Locatelli.  Simulated Annealing Algorithms for Continuous Global Optimization: Convergence Conditions , 2000 .

[14]  Claude J. P. Bélisle.  Convergence theorems for a class of simulated annealing algorithms on ℝd , 1992 .

[15]  D. G. Brooks,et al.  Computational experience with generalized simulated annealing over continuous variables , 1988 .

[16]  Andrew E. W. Jones,et al.  An adaptive simulated annealing algorithm for global optimization over continuous variables , 1995, J. Glob. Optim..