On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization (Q2815548)
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 complexity of nonlinear stepsize control algorithms for convex unconstrained optimization |
scientific article; zbMATH DE number 6599538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization |
scientific article; zbMATH DE number 6599538 |
Statements
On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization (English)
0 references
29 June 2016
0 references
worst-case complexity
0 references
trust-region methods
0 references
regularization methods
0 references
unconstrained optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9240539073944092
0 references
0.9173085689544678
0 references
0.8731796741485596
0 references
0.7887484431266785
0 references
0.7830671072006226
0 references
