2016
DOI: 10.1111/itor.12292
|View full text |Cite
|
Sign up to set email alerts
|

Surrogate‐based methods for black‐box optimization

Abstract: In this paper, we survey methods that are currently used in black-box optimization, that is, the kind of problems whose objective functions are very expensive to evaluate and no analytical or derivative information is available. We concentrate on a particular family of methods, in which surrogate (or meta) models are iteratively constructed and used to search for global solutions.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
62
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 123 publications
(64 citation statements)
references
References 64 publications
0
62
0
Order By: Relevance
“…More practical co-evolutionary approaches, for example using only small numbers of populations for the outer search and the inner (uncertainty) search which share information between populations from generation to generation, or following several generations, require the application of additional simplifications and assumptions, see [CSZ09,MKA11]. One general area of research is the use of emulation to reduce the potential burden of computational run times and the number of modelfunction evaluations, see [VDYL16]. [ZZ10] use a surrogate-assisted evolutionary algorithm to tackle the inner search for black-box min max problems.…”
Section: Metaheuristic For Robust Optimisationmentioning
confidence: 99%
“…More practical co-evolutionary approaches, for example using only small numbers of populations for the outer search and the inner (uncertainty) search which share information between populations from generation to generation, or following several generations, require the application of additional simplifications and assumptions, see [CSZ09,MKA11]. One general area of research is the use of emulation to reduce the potential burden of computational run times and the number of modelfunction evaluations, see [VDYL16]. [ZZ10] use a surrogate-assisted evolutionary algorithm to tackle the inner search for black-box min max problems.…”
Section: Metaheuristic For Robust Optimisationmentioning
confidence: 99%
“…71 Other tasks such as SA, analysis of variance, parameter screening, and model calibration can be efficiently conducted using the surrogate without worrying about the computational cost. 67,70,72,73 Building the surrogate can be done through a variety of methods based on classical machine learning algorithms, some of them that are related to this framework we highlight here. Polynomial chaos expansion (PCE) is one of the most common and earliest methods used to construct surrogate models, and it is expressed by [74][75][76]…”
Section: Machine Learning Deep Learning and Data Sciencementioning
confidence: 99%
“…Hence, kriging [38] is well adapted to construct such surrogate functions. Interested readers are invited to refer to [24,36,41] and references therein for a review on this subject. In our work, kriging consists in regarding the approximate predictionê as a special Gaussian stochastic process of spatial covariance given by…”
Section: Metamodeling and Adaptive Global Optimizationmentioning
confidence: 99%