Proposal adaptation in simulated annealing for continuous optimization problems
From MaRDI portal
Publication:2259210
DOI10.1007/s00180-013-0395-8zbMath1306.65137MaRDI QIDQ2259210
Publication date: 27 February 2015
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00180-013-0395-8
62-08: Computational methods for problems pertaining to statistics
Related Items
A Simulated Annealing-Based Barzilai–Borwein Gradient Method for Unconstrained Optimization Problems
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Adaptive proposal distribution for random walk Metropolis algorithm
- A Monte Carlo simulated annealing approach to optimization over continuous variables
- The parallel genetic algorithm as function optimizer
- Convergence of the simulated annealing algorithm for continuous global optimization
- An adaptive simulated annealing algorithm for global optimization over continuous variables
- Simulated annealing algorithms for continuous global optimization: Convergence conditions
- Sequential Monte Carlo Methods in Practice
- Adaptive Multiple Importance Sampling
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Simulated annealing process in general state space
- Safe and Effective Importance Sampling
- Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
- Equation of State Calculations by Fast Computing Machines
- An adaptive Metropolis algorithm
