Sequential Monte Carlo simulated annealing
From MaRDI portal
Recommendations
- Posterior exploration based sequential Monte Carlo for global optimization
- Simulated annealing using hybrid Monte Carlo
- Simulated stochastic approximation annealing for global optimization with a square-root cooling schedule
- Improving simulated annealing through derandomization
- scientific article; zbMATH DE number 1857675
Cites work
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 2106098 (Why is no real title available?)
- A tutorial on the cross-entropy method
- Convergence of the simulated annealing algorithm for continuous global optimization
- Convergence properties of simulated annealing for continuous global optimization
- Convergence theorems for a class of simulated annealing algorithms on ℝd
- Cooling Schedules for Optimal Annealing
- Following a moving target -- Monte Carlo inference for dynamic Bayesian models
- General state space Markov chains and MCMC algorithms
- Global optimization and simulated annealing
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Handbook of global optimization. Vol. 2
- Introduction to Stochastic Search and Optimization
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Multi-particle simulated annealing
- Nonstationary Markov chains and convergence of the annealing algorithm
- Optimization by simulated annealing
- Parallel recombinative simulated annealing: A genetic algorithm
- Parallel simulated annealing algorithms in global optimization
- Parallel simulated annealing by mixing of states
- Sequential Monte Carlo Methods for Dynamic Systems
- Sequential Monte Carlo Samplers
- Simulated annealing algorithms for continuous global optimization: Convergence conditions
- Simulated annealing for constrained global optimization
- Simulated annealing methods with general acceptance probabilities
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- The Theory and Practice of Simulated Annealing
- The cross-entropy method for combinatorial and continuous optimization
- The cross-entropy method for continuous multi-extremal optimization
- The interacting-particle algorithm with dynamic heating and cooling
Cited in
(9)- Proposal adaptation in simulated annealing for continuous optimization problems
- Parallel sequential Monte Carlo for stochastic gradient-free nonconvex optimization
- A flexible sequential Monte Carlo algorithm for parametric constrained regression
- Posterior exploration based sequential Monte Carlo for global optimization
- Sequentially adaptive Bayesian learning algorithms for inference and optimization
- Improving simulated annealing through derandomization
- Simulated annealing using hybrid Monte Carlo
- Annealing evolutionary stochastic approximation Monte Carlo for global optimization
- Annealing evolutionary stochastic approximation Monte Carlo for global optimization
This page was built for publication: Sequential Monte Carlo simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1937969)
