Efficient computation of expected hypervolume improvement using box decomposition algorithms (Q2274866): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: EGO / rank | |||
Normal rank | |||
Revision as of 00:54, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient computation of expected hypervolume improvement using box decomposition algorithms |
scientific article |
Statements
Efficient computation of expected hypervolume improvement using box decomposition algorithms (English)
0 references
1 October 2019
0 references
expected hypervolume improvement
0 references
probability of improvement
0 references
time complexity
0 references
multi-objective Bayesian global optimization
0 references
hypervolume indicator
0 references
Kriging
0 references
