Computing 3-D expected hypervolume improvement and related integrals in asymptotically optimal time
From MaRDI portal
Publication:5215919
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
Cited in
(10)- A portfolio approach to massively parallel Bayesian optimization
- 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
- A multicriteria generalization of Bayesian global optimization
- A study on many-objective optimization using the Kriging-surrogate-based evolutionary algorithm maximizing expected hypervolume improvement
- Targeting solutions in Bayesian multi-objective optimization: sequential and batch versions
- MVMOO: mixed variable multi-objective optimisation
- Bayesian optimization
- 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)