Simple conditions for the convergence of simulated annealing type algorithms
From MaRDI portal
Publication:4248124
DOI10.1239/jap/1032438383zbMath0932.65068OpenAlexW1983995059MaRDI QIDQ4248124
J. Rego Cruz, Chang Chung Yu Dorea
Publication date: 15 March 2000
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/jap/1032438383
Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Numerical analysis or methods applied to Markov chains (65C40)
Related Items (3)
Using simulated annealing to optimize the feature selection problem in marketing applications ⋮ Sufficient Conditions for Ergodicity and Convergence of MH, SA, and EM Algorithms ⋮ On weak and strong ergodicity
This page was built for publication: Simple conditions for the convergence of simulated annealing type algorithms