Simulated annealing algorithms for continuous global optimization: Convergence conditions
From MaRDI portal
Publication:1973485
DOI10.1023/A:1004680806815zbMath0970.90102OpenAlexW148948641MaRDI QIDQ1973485
Publication date: 14 December 2000
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1004680806815
strong convergencecontinuous global optimizationsimulated annealing algorithmsunconsidered nonlinear programming
Related Items
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms, DE-VNS: self-adaptive differential evolution with crossover neighborhood search for continuous global optimization, A flexible sequential Monte Carlo algorithm for parametric constrained regression, Study of multiscale global optimization based on parameter space partition, Sequential Monte Carlo simulated annealing, Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms, Design of fork-join networks of First-In-First-out and infinite-server queues applied to clinical chemistry laboratories, From simulated annealing to stochastic continuation: a new trend in combinatorial optimization, An analytically derived cooling schedule for simulated annealing, Adaptive search with stochastic acceptance probabilities for global optimization, Convergence results for a class of time-varying simulated annealing algorithms, Annealing diffusions in a potential function with a slow growth, Optimisation of the total population size with respect to the initial condition for semilinear parabolic equations: two-scale expansions and symmetrisations, Proposal adaptation in simulated annealing for continuous optimization problems, A generalized worst-case complexity analysis for non-monotone line searches, Outdoor WLAN planning via non-monotone derivative-free optimization: Algorithm adaptation and case study, Comparative analysis of the cutting angle and simulated annealing methods in global optimization, Geometric adaptive Monte Carlo in random environment, Efficient hybrid methods for global continuous optimization based on simulated annealing
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Global optimization and stochastic differential equations
- 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
- Simulated annealing for constrained global optimization
- An adaptive simulated annealing algorithm for global optimization over continuous variables
- Convergence properties of simulated annealing for continuous global optimization
- Generalized Simulated Annealing for Function Optimization
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Cooling Schedules for Optimal Annealing
- Recursive Stochastic Algorithms for Global Optimization in $\mathbb{R}^d $
- Metropolis-Type Annealing Algorithms for Global Optimization in $\mathbb{R}^d $
- Computational Experience with Generalized Simulated Annealing Over Continuous Variables
