Adaptive restart of the optimized gradient method for convex optimization

DOI10.1007/s10957-018-1287-4zbMath1406.90093arXiv1703.04641OpenAlexW3100607587WikidataQ129895990 ScholiaQ129895990MaRDI QIDQ1670019

Jeffrey A. Fessler, Donghwan Kim

Publication date: 4 September 2018

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationfirst-order methodsoptimized gradient methodrestartingaccelerated gradient methods

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

Improving “Fast Iterative Shrinkage-Thresholding Algorithm”: Faster, Smarter, and Greedier ⋮ Adaptive restart of the optimized gradient method for convex optimization ⋮ An Iterative Reduction FISTA Algorithm for Large-Scale LASSO ⋮ Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods ⋮ Practical perspectives on symplectic accelerated optimization ⋮ Fast gradient method for low-rank matrix estimation ⋮ Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection ⋮ Non-monotone Behavior of the Heavy Ball Method ⋮ A piecewise conservative method for unconstrained convex optimization ⋮ Bilevel Methods for Image Reconstruction

Uses Software

• UNLocBoX

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An adaptive accelerated first-order method for convex optimization
• Optimized first-order methods for smooth convex minimization
• Gradient methods for minimizing composite functions
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• The exact information-based complexity of smooth convex minimization
• On the convergence analysis of the optimized gradient method
• On parallel complexity of nonsmooth convex optimization
• Introductory lectures on convex optimization. A basic course.
• Adaptive restart of the optimized gradient method for convex optimization
• Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
• Performance of first-order methods for smooth convex minimization: a novel approach
• Adaptive restart for accelerated gradient schemes
• A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
• Proximal Splitting Methods in Signal Processing
• Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
• Restart procedures for the conjugate gradient method
• Generalizing the Optimized Gradient Method for Smooth Convex Minimization

This page was built for publication: Adaptive restart of the optimized gradient method for convex optimization