An optimal gradient method for smooth strongly convex minimization

DOI10.1007/S10107-022-01839-YzbMath1518.90071arXiv2101.09741MaRDI QIDQ6038652

Yoel Drori, Adrien B. Taylor

Publication date: 2 May 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

worst-case boundconstructive recipe

Mathematics Subject Classification ID

Convex programming (90C25) Methods of reduced gradient type (90C52)

Related Items (7)

Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods ⋮ Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ Provably faster gradient descent via long steps ⋮ Interpolation conditions for linear operators and applications to performance estimation problems ⋮ PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python ⋮ Accelerated minimax algorithms flock together

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Optimized first-order methods for smooth convex minimization
• Smooth strongly convex interpolation and exact worst-case performance of first-order methods
• The exact information-based complexity of smooth convex minimization
• On the convergence analysis of the optimized gradient method
• Information-based complexity of linear operator equations
• Introductory lectures on convex optimization. A basic course.
• On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
• Universal method for stochastic composite optimization problems
• Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions
• On the oracle complexity of smooth strongly convex minimization
• Efficient first-order methods for convex minimization: a constructive approach
• Performance of first-order methods for smooth convex minimization: a novel approach
• Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
• Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization

This page was built for publication: An optimal gradient method for smooth strongly convex minimization