Simulated annealing for almost sure convergent random sequences

MaRDI QIDQ2774485zbMATH OpenFDO

Authors C. Poppinga

Publication date 28 February 2002

Published in Statistics \& Decisions (Search for Journal in Brave)

zbMATH Keywords

Markov chainsoptimization problemsimulated annealing algorithm

Mathematics Subject Classification ID

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

Recommendations

• Note on the Convergence of Simulated Annealing Algorithms
• scientific article; zbMATH DE number 218214
• scientific article; zbMATH DE number 4079162
• Convergence and finite-time behavior of simulated annealing
• Cooling Schedules for Optimal Annealing

Cited in

(4)

• Convergence results for a class of time-varying simulated annealing algorithms
• Improving simulated annealing through derandomization
• Adaptive simulated annealing: A near-optimal connection between sampling and counting
• An exact D-dimensional Tsallis random number generator for generalized simulated annealing

This page was built for publication: Simulated annealing for almost sure convergent random sequences

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