Lower bounds on the noiseless worst-case complexity of efficient global optimization (Q6536837)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7846595
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds on the noiseless worst-case complexity of efficient global optimization |
scientific article; zbMATH DE number 7846595 |
Statements
Lower bounds on the noiseless worst-case complexity of efficient global optimization (English)
0 references
14 May 2024
0 references
efficient global optimization
0 references
worst-case complexity
0 references
reproducing kernel Hilbert space
0 references
0 references
0 references
0 references
0 references
0 references
0.7718086838722229
0 references
0.7559943795204163
0 references
0.7334937453269958
0 references
0.7328763008117676
0 references
0.7269156575202942
0 references
