×

zbMATH — the first resource for mathematics

On the complexity of steepest descent, Newton’s and regularized Newton’s methods for nonconvex unconstrained optimization problems. (English) Zbl 1211.90225

MSC:
90C30 Nonlinear programming
65K05 Numerical mathematical programming methods
49M37 Numerical methods based on nonlinear programming
49M15 Newton-type methods
49M05 Numerical methods based on necessary conditions
58C15 Implicit function theorems; global Newton methods on manifolds
90C60 Abstract computational complexity for mathematical programming problems
68Q25 Analysis of algorithms and problem complexity
PDF BibTeX XML Cite
Full Text: DOI