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

Published 2010 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
Authors
Keywords
-
Journal
SIAM JOURNAL ON OPTIMIZATION
Volume 20, Issue 6, Pages 2833-2852
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Online
2010-09-10
DOI
10.1137/090774100
References
View 2 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.