On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions

Published 2016 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
Authors
Keywords
Gradient method, Steepest descent, Semidefinite programming, Performance estimation problem
Journal
Optimization Letters
Volume 11, Issue 7, Pages 1185-1199
Publisher
Springer Nature
Online
2016-10-14
DOI
10.1007/s11590-016-1087-4
References
View 2 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
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.