Worst case complexity of direct search (Q743632)
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: Worst case complexity of direct search |
scientific article; zbMATH DE number 6349862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst case complexity of direct search |
scientific article; zbMATH DE number 6349862 |
Statements
Worst case complexity of direct search (English)
0 references
30 September 2014
0 references
derivative-free optimization
0 references
direct search
0 references
worst case complexity
0 references
sufficient decrease
0 references
0 references
0 references
0.9381191730499268
0 references
0.9038419127464294
0 references
0.8863504528999329
0 references
0.8508157730102539
0 references
0.8485972285270691
0 references
