Locatelli, M. Convergence of a simulated annealing algorithm for continuous global optimization. (English) Zbl 1039.90100 J. Glob. Optim. 18, No. 3, 219-234 (2000). The author considers a simulated annealing algorithm for minimizing a continuous function \(f\) over a convex, compact, full-dimensional set \(X\). It is assumed that \(f\) has only a finite number of global minima over \(X\). The cooling schedule is based on the distance between the function value in the current point and an estimate of the global optimum. Under certain assumptions on the cooling schedule and on the distribution of the next candidate point it is shown that the considered simulated annealing algorithm converges in probability to a global optimum. Reviewer: Rainer E. Burkard (Graz) Cited in 11 Documents MSC: 90C59 Approximation methods and heuristics in mathematical programming 68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) Keywords:global optimization; simulated annealing; cooling schedule PDFBibTeX XMLCite \textit{M. Locatelli}, J. Glob. Optim. 18, No. 3, 219--234 (2000; Zbl 1039.90100) Full Text: DOI