Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization

Linear convergence of first order methods for non-strongly convex optimization

(2018) I. Necoara et al.   MATHEMATICAL PROGRAMMING

The exact information-based complexity of smooth convex minimization

(2017) Yoel Drori   JOURNAL OF COMPLEXITY

Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization

(2017) Adrien B. Taylor et al.   SIAM JOURNAL ON OPTIMIZATION

Smooth strongly convex interpolation and exact worst-case performance of first-order methods

(2016) Adrien B. Taylor et al.   MATHEMATICAL PROGRAMMING

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

(2016) Etienne de Klerk et al.   Optimization Letters

Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints

(2016) Laurent Lessard et al.   SIAM JOURNAL ON OPTIMIZATION

Optimized first-order methods for smooth convex minimization

(2015) Donghwan Kim et al.   MATHEMATICAL PROGRAMMING

Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization

(2014) Hui Zhang et al.   Optimization Letters

Performance of first-order methods for smooth convex minimization: a novel approach

(2013) Yoel Drori et al.   MATHEMATICAL PROGRAMMING

First-order methods of smooth convex optimization with inexact oracle

(2013) Olivier Devolder et al.   MATHEMATICAL PROGRAMMING

Gradient methods for minimizing composite functions

(2012) Yu. Nesterov   MATHEMATICAL PROGRAMMING

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems

(2012) Yu. Nesterov   SIAM JOURNAL ON OPTIMIZATION