A Simple Nearly Optimal Restart Scheme For Speeding Up First-Order Methods
- 26 March 2021
- journal article
- research article
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 22 (1) , 211-256
Abstract
No abstract availableKeywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Smoothing and First Order Methods: A Unified FrameworkSIAM Journal on Optimization, 2012
- First-order algorithm with ${\mathcal{O}({\rm ln}(1{/}\epsilon))}$ convergence for ${\epsilon}$ -equilibrium in two-person zero-sum gamesMathematical Programming, 2010
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- Smoothing Technique and its Applications in Semidefinite OptimizationMathematical Programming, 2006
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Bregman Monotone Optimization AlgorithmsSIAM Journal on Control and Optimization, 2003
- Sur la géométrie semi- et sous- analytiqueAnnales de l'institut Fourier, 1993
- Optimal methods of smooth convex minimizationUSSR Computational Mathematics and Mathematical Physics, 1985
- On convergence rates of subgradient optimization methodsMathematical Programming, 1977
- Gradient methods for the minimisation of functionalsUSSR Computational Mathematics and Mathematical Physics, 1963