On Lower and Upper Bounds for Smooth and Strongly Convex Optimization Problems

zbMath1391.90467arXiv1503.06833MaRDI QIDQ2834440

Ohad Shamir, Yossi Arjevani, Shai Shalev-Shwartz

Publication date: 22 November 2016

Full work available at URL: https://arxiv.org/abs/1503.06833

zbMATH Keywords

heavy ball methodaccelerated gradient descentfull gradient descentsmooth and strongly convex optimization

Mathematics Subject Classification ID

Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56) Quadratic programming (90C20)

Related Items (10)

Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization ⋮ Bregman proximal point type algorithms for quasiconvex minimization ⋮ Lower bounds for finding stationary points I ⋮ Efficient first-order methods for convex minimization: a constructive approach ⋮ Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice ⋮ An optimal randomized incremental gradient method ⋮ Bounds for the tracking error of first-order online optimization methods ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On strongly quasiconvex functions: existence results and proximal point algorithms

This page was built for publication: On Lower and Upper Bounds for Smooth and Strongly Convex Optimization Problems