An adaptive simulated annealing algorithm.
From MaRDI portal
Inspired by the idea of the Metropolis algorithm, the authors propose a new sample adaptive simulated annealing algorithm on finite state space. The algorithm can be considered as a substitute of the annealing of iterative stochastic schemes in case of finite state space and can be hopefully extended to the denumerable state case with some modifications. The convergence of the algorithm is proved.
Recommendations
Cites work
- Annealing of Iterative Stochastic Schemes
- Asymptotic Global Behavior for Stochastic Approximation and Diffusions with Slowly Decreasing Noise Effects: Global Minimization via Monte Carlo
- Geometric bounds for eigenvalues of Markov chains
- scientific article; zbMATH DE number 46932 (Why is no real title available?)
- scientific article; zbMATH DE number 48727 (Why is no real title available?)
- scientific article; zbMATH DE number 53271 (Why is no real title available?)
- scientific article; zbMATH DE number 107465 (Why is no real title available?)
- Metropolis-Type Annealing Algorithms for Global Optimization in $\mathbb{R}^d $
- Optimization by simulated annealing
- Recursive Stochastic Algorithms for Global Optimization in $\mathbb{R}^d $
- Self-organization and associative memory
- Simulated annealing via Sobolev inequalities
- Simulated annealing with time-dependent energy function
- Simulated annealing with time-dependent energy function via Sobolev inequalities
- Théorèmes de convergence presque sure pour une classe d'algorithmes stochastiques à pas decroissant
Cited in
(6)- Fast simulated annealing in R^d with an application to maximum likelihood estimation in state-space models
- Automatic histogram and variogram reproduction in simulated annealing simulation
- Oscillation of metropolis-Hastings and simulated annealing algorithms around LASSO estimator
- Proposal adaptation in simulated annealing for continuous optimization problems
- A new simulated annealing algorithm with the model of virus evolution
- Improved Metropolis-Hastings algorithms via landscape modifcation with applications to simulated annealing and the Curie-Weiss model
This page was built for publication: An adaptive simulated annealing algorithm.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1888770)