New analysis of linear convergence of gradient-type methods via unifying error bound conditions
Author:
- 4 January 2019
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 180 (1-2) , 371-416
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (11501569)
This publication has 43 references indexed in Scilit:
- Performance of first-order methods for smooth convex minimization: a novel approachMathematical Programming, 2013
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and ConvergenceSIAM Journal on Optimization, 2008
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic featuresMathematical Programming, 2007
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth MinimizationSIAM Journal on Control and Optimization, 1992
- Asymptotic Convergence Analysis of the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1984
- Some continuity properties of polyhedral multifunctions1981
- Asymptotic convergence of nonlinear contraction semigroups in Hilbert spaceJournal of Functional Analysis, 1975
- Gradient methods for the minimisation of functionalsUSSR Computational Mathematics and Mathematical Physics, 1963