Efficient computation of expected hypervolume improvement using box decomposition algorithms

标题
Efficient computation of expected hypervolume improvement using box decomposition algorithms
作者
关键词
Expected hypervolume improvement, Probability of improvement, Time complexity, Multi-objective Bayesian global optimization, Hypervolume indicator, Kriging
出版物
JOURNAL OF GLOBAL OPTIMIZATION
Volume -, Issue -, Pages -
出版商
Springer Science and Business Media LLC
发表日期
2019-07-03
DOI
10.1007/s10898-019-00798-7

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Create your own webinar

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

Create Now

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started