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.- Sort by
- Weight
- Alphabetically
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 journal › Article › peer-review
90
Downloads
(Pure)