Skip to main navigation Skip to search Skip to main content

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

Research output: Contribution to journalArticlepeer-review

191 Downloads (Pure)

Search results