Computing 3-D Expected Hypervolume Improvement and Related Integrals in Asymptotically Optimal Time

DOI10.1007/978-3-319-54157-0_46zbMath1430.90522OpenAlexW2589080402MaRDI QIDQ5215919

A. H. Deutz, Carlos M. Fonseca, Michael Emmerich, Kaifeng Yang

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

zbMATH Keywords

time complexityexpected hypervolume improvementefficient global optimizationprobability of improvementsurrogate-assisted multi-criterion optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (5)

Expected improvement for expensive optimization: a review ⋮ Efficient computation of expected hypervolume improvement using box decomposition algorithms ⋮ Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm ⋮ Targeting solutions in Bayesian multi-objective optimization: sequential and batch versions ⋮ MVMOO: mixed variable multi-objective optimisation

This page was built for publication: Computing 3-D Expected Hypervolume Improvement and Related Integrals in Asymptotically Optimal Time