An adaptive simulated annealing algorithm.

DOI10.1016/S0304-4149(01)00082-5zbMath1053.60054OpenAlexW2021094039MaRDI QIDQ1888770

Gong Guanglu, Yong Liu, Min-ping Qian

Publication date: 26 November 2004

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-4149(01)00082-5

zbMATH Keywords

simulated annealingadaptive algorithmMarkov chain

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Stochastic processes (60G99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Self-organization and associative memory
• Geometric bounds for eigenvalues of Markov chains
• Théorèmes de convergence presque sure pour une classe d'algorithmes stochastiques à pas decroissant
• Simulated annealing via Sobolev inequalities
• Simulated annealing with time-dependent energy function via Sobolev inequalities
• Simulated annealing with time-dependent energy function
• Recursive Stochastic Algorithms for Global Optimization in $\mathbb{R}^d $
• Annealing of Iterative Stochastic Schemes
• Metropolis-Type Annealing Algorithms for Global Optimization in $\mathbb{R}^d $
• Asymptotic Global Behavior for Stochastic Approximation and Diffusions with Slowly Decreasing Noise Effects: Global Minimization via Monte Carlo