On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392)
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: On the worst-case evaluation complexity of non-monotone line search algorithms |
scientific article; zbMATH DE number 6833520
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the worst-case evaluation complexity of non-monotone line search algorithms |
scientific article; zbMATH DE number 6833520 |
Statements
On the worst-case evaluation complexity of non-monotone line search algorithms (English)
0 references
1 February 2018
0 references
nonlinear optimization
0 references
unconstrained optimization
0 references
non-monotone line search
0 references
worst-case complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
