A new taxonomy of global optimization algorithms (Q6137180)

scientific article; zbMATH DE number 7733308

Language	Label	Description	Also known as
English	A new taxonomy of global optimization algorithms	scientific article; zbMATH DE number 7733308

Statements

instance of

scholarly article

0 references

title

A new taxonomy of global optimization algorithms (English)

0 references

author

Jörg Stork

0 references

A. E. Eiben

0 references

Thomas Bartz-Beielstein

0 references

published in

Natural Computing

0 references

publication date

1 September 2023

0 references

full work available at URL

https://arxiv.org/abs/1808.08818

0 references

zbMATH Keywords

metaheuristics

0 references

surrogate

0 references

hybrid optimization

0 references

evolutionary computation

0 references

taxonomy

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q3824107

0 references

A comparison of evolution strategies with other direct search methods in the presence of noise

0 references

A Survey on Direct Search Methods for Blackbox Optimization and Their Applications

0 references

Q4331755

0 references

Q5687948

0 references

The Sequential Parameter Optimization Toolbox

0 references

SMS-EMOA: multiobjective selection based on dominated hypervolume

0 references

Evolution strategies. A comprehensive introduction

0 references

Hybrid Metaheuristics

0 references

A survey on optimization metaheuristics

0 references

Random forests

0 references

Q3327527

0 references

Hyper-Heuristics: An Emerging Direction in Modern Search Technology

0 references

Tabu search applied to global optimization

0 references

Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art

0 references

Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here

0 references

Q2779809

0 references

Q4472016

0 references

Exploration and exploitation in evolutionary algorithms

0 references

A Novel Hybrid Sequential Design Strategy for Global Surrogate Modeling of Computer Experiments

0 references

Optimal parameter choices via precise black-box analysis

0 references

Q5396673

0 references

Introduction to evolutionary computing

0 references

Introduction to evolutionary computing

0 references

Q4091368

0 references

Q5527536

0 references

A decision-theoretic generalization of on-line learning and an application to boosting

0 references

Tabu Search—Part I

0 references

Global optimization of statistical functions with simulated annealing

0 references

Q4434988

0 references

Variable neighbourhood search: methods and applications

0 references

The Theory and Practice of Simulated Annealing

0 references

A Fast Learning Algorithm for Deep Belief Nets

0 references

Multilayer feedforward networks are universal approximators

0 references

A taxonomy of global optimization methods based on response surfaces

0 references

Efficient global optimization of expensive black-box functions

0 references

Optimization by Simulated Annealing

0 references

Q4435425

0 references

Q4845469

0 references

Q2769922

0 references

Branch-and-Bound Methods: A Survey

0 references

Direct search methods: Then and now

0 references

On the limited memory BFGS method for large scale optimization

0 references

Parameter setting in evolutionary algorithms.

0 references

Q4788634

0 references

Survey of multi-objective optimization methods for engineering

0 references

Optimal aeroacoustic shape design using the surrogate management framework

0 references

General variable neighborhood search for the continuous optimization

0 references

Q4070997

0 references

Application of Bayesian approach to numerical methods of global and stochastic optimization

0 references

Q3993195

0 references

Q3339582

0 references

MISO: mixed-integer surrogate optimization framework

0 references

Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms for~computationally expensive black-box global optimization problems

0 references

Evolutionary Multi-Criterion Optimization

0 references

A Simplex Method for Function Minimization

0 references

Complete search in continuous global optimization and constraint satisfaction

0 references

An introduction to quantum computing algorithms

0 references

Design and analysis of computer experiments. With comments and a rejoinder by the authors

0 references

Q4117322

0 references

Conditioning of Quasi-Newton Methods for Function Minimization

0 references

FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES

0 references

Enhanced simulated annealing for globally minimizing functions of many-continuous variables

0 references

Q5191184

0 references

Global optimization

0 references

Q4414647

0 references

Model-based search for combinatorial optimization: A critical survey

0 references

Identifiers

zbMATH Open document ID

1530.90116

0 references

arXiv ID

1808.08818

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1007/S11047-020-09820-4

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6137180