A hybrid algorithm for identifying global and local minima when optimizing functions with many minima.
From MaRDI portal
Publication:1428045
Recommendations
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- A hybrid evolutionary algorithm for global optimization
- A successive descent algorithm over a system of local minima
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- A hybrid genetic algorithm for nonconvex function minimization.
Cites work
- scientific article; zbMATH DE number 3598385 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1488071 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- A Simplex Method for Function Minimization
- A continuous genetic algorithm designed for the global optimization of multimodal functions
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization
- A tabu search approach for the resource constrained project scheduling problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- Enhanced simulated annealing for globally minimizing functions of many-continuous variables
- FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES
- General Purpose Simulated Annealing
- Global optimization and simulated annealing
- Global optimization and stochastic differential equations
- Optimization by simulated annealing
- Stochastic global optimization methods part II: Multi level methods
- Taboo Search: An Approach to the Multiple Minima Problem
- Tabu search applied to global optimization
- The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
- Using simulated annealing to solve routing and location problems
Cited in
(16)- Interval oriented multi-section techniques for global optimization
- scientific article; zbMATH DE number 1728444 (Why is no real title available?)
- Efficient hybrid methods for global continuous optimization based on simulated annealing
- A successive descent algorithm over a system of local minima
- A hybrid evolutionary algorithm for global optimization
- Real-coded genetic algorithm with variable rates of cross-over and mutation: a basis of global optimization for multi-modal functions via interval technique
- Hybrid genetic deflated Newton method for global optimisation
- CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method
- An efficient hybrid algorithm for the optimization of problems with several local minima
- An efficient algorithm for range computation of polynomials using the Bernstein form
- A hybrid descent method for global optimization
- A memetic particle swarm optimisation algorithm for dynamic multi-modal optimisation problems
- GEM: A novel evolutionary optimization method with improved neighborhood search
- Hybrid approach for global optima of indifferentiable nonlinear function
- MinFinder: locating all the local minima of a function
- An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
This page was built for publication: A hybrid algorithm for identifying global and local minima when optimizing functions with many minima.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1428045)
