Worst case complexity bounds for linesearch-type derivative-free algorithms (Q6636792)
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 7942677
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst case complexity bounds for linesearch-type derivative-free algorithms |
scientific article; zbMATH DE number 7942677 |
Statements
Worst case complexity bounds for linesearch-type derivative-free algorithms (English)
0 references
12 November 2024
0 references
derivative-free optimization
0 references
unconstrained optimization
0 references
line search
0 references
worst case complexity
0 references
0 references
0 references
0 references
0 references
0 references
0.8234744668006897
0 references
0.813543438911438
0 references
0.8063954710960388
0 references
0.8046183586120605
0 references
0.7861930131912231
0 references
