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

标题
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
作者
关键词
Gradient method, Steepest descent, Semidefinite programming, Performance estimation problem
出版物
Optimization Letters
Volume 11, Issue 7, Pages 1185-1199
出版商
Springer Nature
发表日期
2016-10-14
DOI
10.1007/s11590-016-1087-4

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now