An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization (Q5854356)
From MaRDI portal
scientific article; zbMATH DE number 7323650
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization |
scientific article; zbMATH DE number 7323650 |
Statements
An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization (English)
0 references
16 March 2021
0 references
unconstrained optimization
0 references
nonlinear optimization
0 references
nonconvex optimization
0 references
inexact Newton methods
0 references
worst-case iteration complexity
0 references
worst-case evaluation complexity
0 references
