Computing 3-D expected hypervolume improvement and related integrals in asymptotically optimal time
DOI10.1007/978-3-319-54157-0_46zbMATH Open1430.90522OpenAlexW2589080402MaRDI QIDQ5215919FDOQ5215919
Authors: Kaifeng Yang, Michael Emmerich, A. H. Deutz, Carlos M. Fonseca 
Publication date: 13 February 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1887/59342
Recommendations
- Efficient computation of expected hypervolume improvement using box decomposition algorithms
- A multicriteria generalization of Bayesian global optimization
- Improved quick hypervolume algorithm
- A study on many-objective optimization using the Kriging-surrogate-based evolutionary algorithm maximizing expected hypervolume improvement
- Don't be greedy when calculating hypervolume contributions
time complexityexpected hypervolume improvementefficient global optimizationprobability of improvementsurrogate-assisted multi-criterion optimization
Cited In (6)
- Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm
- Expected improvement for expensive optimization: a review
- Efficient computation of expected hypervolume improvement using box decomposition algorithms
- Targeting solutions in Bayesian multi-objective optimization: sequential and batch versions
- MVMOO: mixed variable multi-objective optimisation
- Pointwise expected hypervolume improvement for expensive multi-objective optimization
This page was built for publication: Computing 3-D expected hypervolume improvement and related integrals in asymptotically optimal time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215919)
