On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems

C. Cartis, Nick Gould, Philippe Toint

Research output: Contribution to journalArticle

8 Downloads (Pure)

Fingerprint Dive into the research topics of 'On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science