A new taxonomy of global optimization algorithms
From MaRDI portal
Publication:6137180
DOI10.1007/s11047-020-09820-4zbMath1530.90116arXiv1808.08818OpenAlexW2888315729MaRDI QIDQ6137180
Thomas Bartz-Beielstein, A. E. Eiben, Jörg Stork
Publication date: 1 September 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.08818
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global optimization of statistical functions with simulated annealing
- Optimization by Simulated Annealing
- Survey of multi-objective optimization methods for engineering
- Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms for~computationally expensive black-box global optimization problems
- A survey on optimization metaheuristics
- Model-based search for combinatorial optimization: A critical survey
- Parameter setting in evolutionary algorithms.
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- On the limited memory BFGS method for large scale optimization
- General variable neighborhood search for the continuous optimization
- Variable neighbourhood search: methods and applications
- Efficient global optimization of expensive black-box functions
- Application of Bayesian approach to numerical methods of global and stochastic optimization
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- A decision-theoretic generalization of on-line learning and an application to boosting
- Tabu search applied to global optimization
- Direct search methods: Then and now
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Evolution strategies. A comprehensive introduction
- Multilayer feedforward networks are universal approximators
- A taxonomy of global optimization methods based on response surfaces
- A comparison of evolution strategies with other direct search methods in the presence of noise
- An introduction to quantum computing algorithms
- Optimal parameter choices via precise black-box analysis
- MISO: mixed-integer surrogate optimization framework
- Optimal aeroacoustic shape design using the surrogate management framework
- Exploration and exploitation in evolutionary algorithms
- The Sequential Parameter Optimization Toolbox
- Hybrid Metaheuristics
- A Novel Hybrid Sequential Design Strategy for Global Surrogate Modeling of Computer Experiments
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Tabu Search—Part I
- FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES
- Enhanced simulated annealing for globally minimizing functions of many-continuous variables
- The Theory and Practice of Simulated Annealing
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- A Survey on Direct Search Methods for Blackbox Optimization and Their Applications
- Complete search in continuous global optimization and constraint satisfaction
- A Fast Learning Algorithm for Deep Belief Nets
- Branch-and-Bound Methods: A Survey
- Conditioning of Quasi-Newton Methods for Function Minimization
- A Simplex Method for Function Minimization
- Evolutionary Multi-Criterion Optimization
- Introduction to evolutionary computing
- Global optimization
- Introduction to evolutionary computing
- Random forests
