Convergence of a simulated annealing algorithm for continuous global optimization.

DOI10.1023/A:1008339019740zbMath1039.90100OpenAlexW1493050248MaRDI QIDQ5928424

Marco Locatelli

Publication date: 2000

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008339019740

zbMATH Keywords

global optimizationsimulated annealingcooling schedule

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (11)

A simulated annealing driven multi-start algorithm for bound constrained global optimization ⋮ Improving simulated annealing through derandomization ⋮ On the convergence rate issues of general Markov search for global minimum ⋮ Study of multiscale global optimization based on parameter space partition ⋮ A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algorithm ⋮ Mesh generation for FEM based on centroidal Voronoi tessellations ⋮ An analytically derived cooling schedule for simulated annealing ⋮ Stopping and restarting strategy for stochastic sequential search in global optimization ⋮ Nonautonomous stochastic search for global minimum in continuous optimization ⋮ Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective ⋮ Adaptive Prediction of Stock Exchange Indices by State Space Wavelet Networks

This page was built for publication: Convergence of a simulated annealing algorithm for continuous global optimization.