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

We consider the gradient (or steepest) descent method with exact line search applied to a strongly convex function with Lipschitz continuous gradient. We establish the exact worst-case rate of convergence of this scheme, and show that this worst-case behavior is exhibited by a certain convex quadrat...

Full description

Bibliographic Details

Published in:	Optimization letters Vol. 11; no. 7; pp. 1185 - 1199
Main Authors:	de Klerk, Etienne, Glineur, François, Taylor, Adrien B.
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2017
Subjects:	Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation Semidefinite programming Performance estimation problem Steepest descent Gradient method
ISSN:	1862-4472, 1862-4480
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!