Efficient computation of expected hypervolume improvement using box decomposition algorithms

Title
Efficient computation of expected hypervolume improvement using box decomposition algorithms
Authors
Keywords
Expected hypervolume improvement, Probability of improvement, Time complexity, Multi-objective Bayesian global optimization, Hypervolume indicator, Kriging
Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume -, Issue -, Pages -
Publisher
Springer Science and Business Media LLC
Online
2019-07-03
DOI
10.1007/s10898-019-00798-7

Ask authors/readers for more resources

Reprint

Contact the author

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started