Expected improvement for expensive optimization: a review
type: Item
instance of: scholarly article
title: Expected improvement for expensive optimization: a review
zbMATH Open document ID: 1465.90104
author: Dawei Zhan
author: H. L. Xing
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7340608
zbMATH Keywords: expected improvement
zbMATH Keywords: parallel computing
zbMATH Keywords: constrained optimization
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: noisy optimization
zbMATH Keywords: multi-fidelity optimization
describes a project that uses: EGO
describes a project that uses: SPACE
describes a project that uses: MOEA/D
describes a project that uses: Spearmint
describes a project that uses: SMAC
describes a project that uses: ParEGO
describes a project that uses: GPareto
describes a project that uses: Hyperopt
describes a project that uses: BOCK
MaRDI profile type: Publication
full work available at URL: s10898-020-00923-x
OpenAlex ID: W3042036888
cites work: Efficient global optimization for high-dimensional constrained problems by using the Kriging models combined with the partial least squares method
cites work: Constrained efficient global optimization with support vector machines
cites work: A supermartingale approach to Gaussian process based sequential design of experiments
cites work: Sequential design of computer experiments for the estimation of a probability of failure
cites work: Quantifying uncertainty on Pareto fronts with Gaussian process conditional simulations
cites work: On the choice of the low-dimensional domain for global optimization via random embeddings
cites work: Convergence rates of efficient global optimization algorithms
cites work: Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization
cites work: Analysis of multi-objective Kriging-based methods for constrained global optimization
cites work: Evolutionary Multi-Criterion Optimization
cites work: A Multicriteria Generalization of Bayesian Global Optimization
cites work: A Bayesian approach to constrained single- and multi-objective optimization
cites work: A multiobjective optimization based framework to balance the global exploration and local exploitation in expensive optimization
cites work: Multi-fidelity optimization via surrogate modelling
cites work: Branch and bound algorithms for maximizing expected improvement functions
cites work: The knowledge-gradient policy for correlated normal beliefs
cites work: A Knowledge-Gradient Policy for Sequential Information Collection
cites work: Bayesian Adaptive Reconstruction of Profile Optima and Optimizers
cites work: Computational intelligence in expensive optimization problems
cites work: Compactly supported correlation functions
cites work: A radial basis function method for global optimization
cites work: An adaptive radial basis algorithm (ARBF) for expensive black-box global optimization
cites work: Min-median-max metamodel-based unconstrained nonlinear optimization problems
cites work: Global optimization of stochastic black-box systems via sequential kriging meta-models
cites work: Comparison of Kriging-based algorithms for simulation optimization with heterogeneous noise
cites work: A taxonomy of global optimization methods based on response surfaces
cites work: Efficient global optimization of expensive black-box functions
cites work: Predicting the output from a complex computer code when fast approximations are available
cites work: Kriging metamodeling in simulation: a review
cites work: Expected improvement in efficient global optimization through bootstrapped Kriging
cites work: A knowledge-based approach to response surface modelling in multifidelity optimization
cites work: Kriging-based infill sampling criterion for constraint handling in multi-objective optimization
cites work: A new expected-improvement algorithm for continuous minimax optimization
cites work: Q4177353
cites work: Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms for~computationally expensive black-box global optimization problems
cites work: Q3394879
cites work: Constrained global optimization of expensive black box functions using radial basis functions
cites work: On the Convergence Rates of Expected Improvement Methods
cites work: Design and analysis of computer experiments. With comments and a rejoinder by the authors
cites work: The design and analysis of computer experiments
cites work: On the design of optimization strategies based on global response surface approximation models
cites work: Multiobjective optimization of expensive-to-evaluate deterministic computer simulator models
cites work: Convergence properties of the expected improvement algorithm with fixed mean and covariance functions
cites work: Efficient global optimization algorithm assisted by multiple surrogate techniques
cites work: Global optimization of expensive-to-evaluate functions: An empirical comparison of two sampling criteria
cites work: An informational approach to the global optimization of expensive-to-evaluate functions
cites work: Bayesian optimization in a billion dimensions via random embeddings
cites work: Q4525807
cites work: Extended co-Kriging interpolation method based on multi-fidelity data
cites work: Nash game based efficient global optimization for large-scale design problems
cites work: Computing 3-D Expected Hypervolume Improvement and Related Integrals in Asymptotically Optimal Time

Expected improvement for expensive optimization: a review (cites work)
cites work: Two-layer adaptive surrogate-assisted evolutionary algorithm for high-dimensional computationally expensive problems

Expected improvement for expensive optimization: a review (cites work)
cites work: Examples of inconsistency in optimization by expected improvement

Expected improvement for expensive optimization: a review (cites work)
cites work: Balancing global and local search in parallel efficient global optimization algorithms

Expected improvement for expensive optimization: a review (cites work)
cites work: Pseudo expected improvement criterion for parallel EGO algorithm

Expected improvement for expensive optimization: a review (DOI)
DOI: 10.1007/S10898-020-00923-X

Expected improvement for expensive optimization: a review (Recommended article)
Recommended article: A complete expected improvement criterion for Gaussian process assisted highly constrained expensive optimization
Similarity Score: 0.84878975
Recommender Run: Recommender Run 3

Expected improvement for expensive optimization: a review (Recommended article)
Recommended article: Optimization via simulation: A review
Similarity Score: 0.84426594
Recommender Run: Recommender Run 3

Expected improvement for expensive optimization: a review (Recommended article)
Recommended article: Branch and bound algorithms for maximizing expected improvement functions
Similarity Score: 0.8409689
Recommender Run: Recommender Run 3

Expected improvement for expensive optimization: a review (Recommended article)
Recommended article: Improving the complexities of approximation algorithms for optimization problems
Similarity Score: 0.8404055
Recommender Run: Recommender Run 3

Expected improvement for expensive optimization: a review (Recommended article)
Recommended article: Constrained optimization in expensive simulation: novel approach
Similarity Score: 0.8395513
Recommender Run: Recommender Run 3

Expected improvement for expensive optimization: a review (Recommended article)
Recommended article: Computational intelligence in expensive optimization problems
Similarity Score: 0.83705574
Recommender Run: Recommender Run 3

Expected improvement for expensive optimization: a review (Recommended article)
Recommended article: The effectiveness of finite improvement algorithms for finding global optima
Similarity Score: 0.8336544
Recommender Run: Recommender Run 3

Expected improvement for expensive optimization: a review (Recommended article)
Recommended article: A new expected-improvement algorithm for continuous minimax optimization
Similarity Score: 0.833124
Recommender Run: Recommender Run 3