An algorithmic framework for the optimization of computationally expensive bi-fidelity black-box problems (Q5882392)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithmic framework for the optimization of computationally expensive bi-fidelity black-box problems |
scientific article; zbMATH DE number 7663655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithmic framework for the optimization of computationally expensive bi-fidelity black-box problems |
scientific article; zbMATH DE number 7663655 |
Statements
An algorithmic framework for the optimization of computationally expensive bi-fidelity black-box problems (English)
0 references
15 March 2023
0 references
global optimization
0 references
black-box optimization
0 references
multi-fidelity optimization
0 references
surrogate models
0 references
0 references
0 references
0 references
0 references
0.772176206111908
0 references
0.7400713562965393
0 references
0.730279266834259
0 references
0.7276225090026855
0 references
0.7272570133209229
0 references
