On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems (2010)

First Author: Cartis C
Attributed to:  Algorithms and Software for Large-Scale Sparse or Structured Systems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1137/090774100

Publication URI: http://dx.doi.org/10.1137/090774100

Type: Journal Article/Review

Parent Publication: SIAM Journal on Optimization

Issue: 6