Simulated annealing algorithms for continuous global optimization: Convergence conditions
From MaRDI portal
Recommendations
- Convergence of a simulated annealing algorithm for continuous global optimization.
- Convergence of the simulated annealing algorithm for continuous global optimization
- scientific article; zbMATH DE number 1857675
- Simple conditions for the convergence of simulated annealing type algorithms
- Convergence and first hitting time of simulated annealing algorithms for continuous global optimization
Cites work
- A Monte Carlo simulated annealing approach to optimization over continuous variables
- A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing
- An adaptive simulated annealing algorithm for global optimization over continuous variables
- Computational Experience with Generalized Simulated Annealing Over Continuous Variables
- Convergence properties of simulated annealing for continuous global optimization
- Cooling Schedules for Optimal Annealing
- Generalized Simulated Annealing for Function Optimization
- Global optimization and stochastic differential equations
- Metropolis-Type Annealing Algorithms for Global Optimization in $\mathbb{R}^d $
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Optimization by simulated annealing
- Recursive Stochastic Algorithms for Global Optimization in $\mathbb{R}^d $
- Simulated annealing for constrained global optimization
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(30)- Optimization by linear kinetic equations and mean-field Langevin dynamics
- Convergence theorems for a class of simulated annealing algorithms on ℝd
- Proposal adaptation in simulated annealing for continuous optimization problems
- Annealing diffusions in a potential function with a slow growth
- Efficient hybrid methods for global continuous optimization based on simulated annealing
- Comparative analysis of the cutting angle and simulated annealing methods in global optimization
- Sequential Monte Carlo simulated annealing
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- scientific article; zbMATH DE number 4039157 (Why is no real title available?)
- Study of multiscale global optimization based on parameter space partition
- Design of fork-join networks of First-In-First-out and infinite-server queues applied to clinical chemistry laboratories
- scientific article; zbMATH DE number 2080323 (Why is no real title available?)
- A generalized worst-case complexity analysis for non-monotone line searches
- Convergence of a simulated annealing algorithm for continuous global optimization.
- From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- A flexible sequential Monte Carlo algorithm for parametric constrained regression
- Outdoor WLAN planning via non-monotone derivative-free optimization: Algorithm adaptation and case study
- On the efficiency of a continuous version of the simulated annealing algorithm
- Adaptive search with stochastic acceptance probabilities for global optimization
- Simulated annealing for constrained global optimization
- An analytically derived cooling schedule for simulated annealing
- Geometric adaptive Monte Carlo in random environment
- Convergence results for a class of time-varying simulated annealing algorithms
- Optimisation of the total population size with respect to the initial condition for semilinear parabolic equations: two-scale expansions and symmetrisations
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms
- Convergence and first hitting time of simulated annealing algorithms for continuous global optimization
- Improving simulated annealing through derandomization
- scientific article; zbMATH DE number 1857675 (Why is no real title available?)
- DE-VNS: self-adaptive differential evolution with crossover neighborhood search for continuous global optimization
This page was built for publication: Simulated annealing algorithms for continuous global optimization: Convergence conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1973485)
