An adaptive simulated annealing algorithm.
From MaRDI portal
Recommendations
Cites work
- 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?)
- 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
- 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
(5)- Automatic histogram and variogram reproduction in simulated annealing simulation
- Improved Metropolis-Hastings algorithms via landscape modifcation with applications to simulated annealing and the Curie-Weiss model
- Proposal adaptation in simulated annealing for continuous optimization problems
- Fast simulated annealing in R^d with an application to maximum likelihood estimation in state-space models
- A new simulated annealing algorithm with the model of virus evolution
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)