Convergence properties of simulated annealing for continuous global optimization

DOI10.2307/3214991zbMath0879.60007OpenAlexW2333540906MaRDI QIDQ3122875

Marco Locatelli

Publication date: 28 January 1998

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214991

zbMATH Keywords

global optimizationsimulated annealing algorithms

Mathematics Subject Classification ID

Combinatorial probability (60C05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (10)

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 ⋮ Sequential Monte Carlo simulated annealing ⋮ Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification ⋮ From simulated annealing to stochastic continuation: a new trend in combinatorial optimization ⋮ Simulated annealing algorithms for continuous global optimization: Convergence conditions ⋮ Maximin design on non hypercube domains and kernel interpolation ⋮ Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective ⋮ Recent developments and trends in global optimization

This page was built for publication: Convergence properties of simulated annealing for continuous global optimization