Efficient Parameter-Free Restarted Accelerated Gradient Methods for Convex and Strongly Convex Optimization
- 9 June 2025
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 206 (2) , 1-42
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Air Force Office of Scientific Research (FA9550-22-1-0088)
This publication has 32 references indexed in Scilit:
- Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradientMathematical Programming, 2024
- A Simple Nearly Optimal Restart Scheme For Speeding Up First-Order MethodsFoundations of Computational Mathematics, 2021
- Linear convergence of first order methods for non-strongly convex optimizationMathematical Programming, 2018
- An adaptive accelerated first-order method for convex optimizationComputational Optimization and Applications, 2015
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimizationComputational Optimization and Applications, 2014
- Fast First-Order Methods for Composite Convex Optimization with BacktrackingFoundations of Computational Mathematics, 2014
- Adaptive Restart for Accelerated Gradient SchemesFoundations of Computational Mathematics, 2013
- Gradient methods for minimizing composite functionsMathematical Programming, 2012
- Iteration-complexity of first-order penalty methods for convex programmingMathematical Programming, 2012
- Introductory Lectures on Convex Optimization2004