Laws of large numbers for the annealing algorithm
From MaRDI portal
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Strong limit theorems (60F15)
Recommendations
- scientific article; zbMATH DE number 4052685
- Rough large deviation estimates for the optimal convergence speed exponent of generalized simulated annealing algorithms
- scientific article; zbMATH DE number 1759479
- Rough large deviation estimates for simulated annealing: Application to exponential schedules
- Sharp large deviations estimates for simulated annealing algorithms
Cites work
- scientific article; zbMATH DE number 3126887 (Why is no real title available?)
- scientific article; zbMATH DE number 3519671 (Why is no real title available?)
- scientific article; zbMATH DE number 3309776 (Why is no real title available?)
- Nonstationary Markov chains and convergence of the annealing algorithm
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
Cited in
(6)- On discrete inhomogeneous exit problems
- Remarks on the ergodicity of simulated annealing algorithms on a graph
- scientific article; zbMATH DE number 4052685 (Why is no real title available?)
- Turning a coin over instead of tossing it
- Applications of sharp large deviations estimates to optimal cooling schedules
- Stick-breaking processes, clumping, and Markov chain occupation laws
This page was built for publication: Laws of large numbers for the annealing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751733)
