A Newton-MR algorithm with complexity guarantees for nonconvex smooth unconstrained optimization (Q6407871)
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: A Newton-MR algorithm with complexity guarantees for nonconvex smooth unconstrained optimization |
scientific article; zbMATH DE number 900543279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Newton-MR algorithm with complexity guarantees for nonconvex smooth unconstrained optimization |
scientific article; zbMATH DE number 900543279 |
Statements
15 August 2022
0 references
math.OC
0 references
