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 journalArticlepeer-review

10 Downloads (Pure)

Search results