Efficient computation of expected hypervolume improvement using box decomposition algorithms
From MaRDI portal
Publication:2274866
DOI10.1007/s10898-019-00798-7zbMath1428.90157arXiv1904.12672OpenAlexW2941114335WikidataQ127574912 ScholiaQ127574912MaRDI QIDQ2274866
Thomas Bäck, Michael Emmerich, Kaifeng Yang, A. H. Deutz
Publication date: 1 October 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.12672
time complexityKrigingexpected hypervolume improvementhypervolume indicatorprobability of improvementmulti-objective Bayesian global optimization
Related Items (5)
Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components ⋮ Computing representations using hypervolume scalarizations ⋮ Deep Gaussian process for multi-objective Bayesian optimization ⋮ Advancements in the computation of enclosures for multi-objective optimization problems ⋮ A robust multi-objective Bayesian optimization framework considering input uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization
- Learning and intelligent optimization. 5th international conference, LION 5, Rome, Italy, January 17--21, 2011. Selected papers
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- Efficient global optimization of expensive black-box functions
- A box decomposition algorithm to compute the hypervolume indicator
- Improved quick hypervolume algorithm
- Efficient computation of the search region in multi-objective optimization
- A Multicriteria Generalization of Bayesian Global Optimization
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A global search method for optimizing nonlinear systems
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Computing 3-D Expected Hypervolume Improvement and Related Integrals in Asymptotically Optimal Time
This page was built for publication: Efficient computation of expected hypervolume improvement using box decomposition algorithms
