Enhanced simulated annealing for globally minimizing functions of many-continuous variables
From MaRDI portal
Recommendations
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- An adaptive simulated annealing algorithm for global optimization over continuous variables
- A direct search variant of the simulated annealing algorithm for optimization involving continuous variables
- A Monte Carlo simulated annealing approach to optimization over continuous variables
Cited in
(37)- A new family of life distributions for dependent data: estimation
- A hybrid algorithm for identifying global and local minima when optimizing functions with many minima.
- Tabu search applied to global optimization
- Efficient sparse ICP
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- An adaptive simulated annealing algorithm for global optimization over continuous variables
- Local Procrustes for manifold embedding: a measure of embedding quality and embedding algorithms
- Review on nature-inspired algorithms
- DESA: a new hybrid global optimization method and its application to analog integrated circuit sizing
- A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algorithm
- Parallelizing simulated annealing algorithms based on high-performance computer
- Global optimization by continuous grasp
- Unified 3D face and ear recognition using wavelets on geometry images
- Global and local real-coded genetic algorithms based on parent-centric crossover operators
- An intelligent genetic algorithm designed for global optimization of multi-minima functions
- Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies
- Efficient hybrid methods for global continuous optimization based on simulated annealing
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
- Parallel continuous simulated annealing for global optimization simulated annealing∗
- État de l'art des méthodes “d'optimisation globale”
- Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
- On the Reynolds equation and the load problem in lubrication: literature review and mathematical modelling
- A direct search variant of the simulated annealing algorithm for optimization involving continuous variables
- A new taxonomy of global optimization algorithms
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- Genanneal: genetically modified simulated annealing
- A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization
- The development of information guided evolution algorithm for global optimization
- An extended mind evolutionary computation model for optimizations
- A novel chaos danger model immune algorithm
- General variable neighborhood search for the continuous optimization
- A new multiobjective simulated annealing algorithm
- Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions
- Speeding up continuous GRASP
- Ant colony optimization for continuous domains
- A new heuristic approach for non-convex optimization problems
This page was built for publication: Enhanced simulated annealing for globally minimizing functions of many-continuous variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375501)
