Convergence properties of simulated annealing for continuous global optimization

DOI10.2307/3214991MaRDI QIDQ3122875zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(11)

• On the efficiency of a continuous version of the simulated annealing algorithm
• Recent developments and trends in global optimization
• On the convergence rate issues of general Markov search for global minimum
• Sequential Monte Carlo simulated annealing
• From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
• Simulated annealing algorithms for continuous global optimization: Convergence conditions
• Improving simulated annealing through derandomization
• Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification
• Study of multiscale global optimization based on parameter space partition
• Maximin design on non hypercube domains and kernel interpolation
• Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122875)