On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10589-017-9928-3 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10589-017-9928-3 / rank | |||
Normal rank | |||
Latest revision as of 05:47, 28 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the worst-case evaluation complexity of non-monotone line search algorithms |
scientific article |
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
