Fetching the paper…
Reading the bibliography…
In 1963, Polyak proposed a simple condition that is sufficient to show a global linear convergence rate for gradient descent.
On approximate solutions of systems of linear inequalities
A. J. Hoffman · 1952
Earlier work this paper cites.
A topological property of real analytic subsets (in French)
S. Łojasiewicz · 1963
Earlier work this paper cites.
Gradient methods for minimizing functionals (in Russian)
B. T. Polyak · 1963
Earlier work this paper cites.
On sufficiency of the Kuhn-Tucker conditions
M. A. Hanson · 1981
Earlier work this paper cites.
Invex functions and duality
B. D. Craven and B. M. Glover · 1985
Earlier work this paper cites.
RPROP - A fast adaptive learning algorithm
M. Riedmiller and H. Braun · 1992
Earlier work this paper cites.
Error bounds and convergence analysis of feasible descent methods: A general approach
Z.-Q. Luo and P. Tseng · 1993
Earlier work this paper cites.
On gradients of functions definable in o-minimal structures
K. Kurdyka · 1998
Earlier work this paper cites.
Degenerate nonlinear programming with a quadratic growth condition
M. Anitescu · 2000
Earlier work this paper cites.
Convex Analysis and Optimization
D. Bertsekas, A. Nedic, and A. Ozdaglar · 2003
Earlier work this paper cites.
An Introduction to Boosting and Leveraging , pages 118–183
R. Meir and G. Rätsch · 2003
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2004
Earlier work this paper cites.
QP algorithms with guaranteed accuracy and run time for support vector machines
D. Hush, P. Kelly, C. Scovel, and I. Steinwart · 2006
Earlier work this paper cites.
Cubic regularization of newton method and its global performance
Y. Nesterov and B. T. Polyak · 2006
Earlier work this paper cites.
Characterization of lojasiewicz inequalities and applications
J. Bolte, A. Daniilidis, O. Ley, and L. Mazet · 2008
Earlier work this paper cites.
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
H. Attouch and J. Bolte · 2009
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Earlier work this paper cites.
Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
P. Tseng and S. Yun · 2009
Cited alongside, same era.
Characterizations of łojasiewicz inequalities: subgradient flows, talweg, convexity
J. Bolte, A. Daniilidis, O. Ley, and L. Mazet · 2010
Cited alongside, same era.
Approximation accuracy, gradient methods, and error bound for structured convex optimization
P. Tseng · 2010
Cited alongside, same era.
Learning output kernels with block coordinate descent
F. Dinuzzo, C. S. Ong, P. Gehler, and G. Pillonetto · 2011
Cited alongside, same era.
Convergence rates of inexact proximal-gradient methods for convex optimization
M. Schmidt, N. L. Roux, and F. Bach · 2011
Cited alongside, same era.
Fast global convergence rates of gradient methods for high-dimensional statistical recovery
Linear convergence of variance-reduced stochastic gradient without strong convexity
P. Gong and J. Ye · 2014
Later among the works it cites.
M. Kadkhodaie, M. Sanjabi, and Z.-Q. Luo · 2014
Later among the works it cites.
An asynchronous parallel stochastic coordinate descent algorithm
J. Liu, S. J. Wright, C. Ré, V. Bittorf, and S. Sridhar · 2014
Later among the works it cites.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
P. Richtárik and M. Takáč · 2014
Later among the works it cites.
Iteration complexity of feasible descent methods for convex optimization
P.-W. Wang and C.-J. Lin · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Agarwal, S. N. Negahban, and M. J. Wainwright · 2012
Cited alongside, same era.
A stochastic gradient method with an exponential convergence rate for finite training sets
N. Le Roux, M. Schmidt, and F. Bach · 2012
Cited alongside, same era.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 2012
Cited alongside, same era.
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized gauss–seidel methods
H. Attouch, J. Bolte, and B. F. Svaiter · 2013
Cited alongside, same era.
Non-strongly-convex smooth stochastic approximation with convergence rate O ( 1 / n ) {O}(1/n)
F. Bach and E. Moulines · 2013
Cited alongside, same era.
ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
M. Gu, L.-H. Lim, and C. J. Wu · 2013
Cited alongside, same era.
On the linear convergence of the proximal gradient method for trace norm regularization
K. Hou, Z. Zhou, A. M.-C. So, and Z.-Q. Luo · 2013
Cited alongside, same era.
Later among the works it cites.
From error bounds to the complexity of first-order descent methods for convex functions
J. Bolte, T. P. Nguyen, J. Peypouquet, and B. W. Suter · 2015
Later among the works it cites.
Asynchronous stochastic coordinate descent: Parallelism and convergence properties
J. Liu and S. J. Wright · 2015
Later among the works it cites.
C. Ma, T. Tappenden, and M. Takáč · 2015
Later among the works it cites.
Linear convergence of first order methods for non-strongly convex optimization
I. Necoara, Y. Nesterov, and F. Glineur · 2015
Later among the works it cites.
Coordinate descent converges faster with the Gauss-Southwell rule than random selection
J. Nutini, M. Schmidt, I. H. Laradji, M. Friedlander, and H. Koepke · 2015
Later among the works it cites.
H. Zhang · 2015
Later among the works it cites.
A unified approach to error bounds for structured convex optimization problems
Z. Zhou and A. M.-C. So · 2015
Later among the works it cites.
Error bounds, quadratic growth, and linear convergence of proximal methods
D. Drusvyatskiy and A. S. Lewis · 2016
Closest in time.
G. Li and T. K. Pong · 2016
Closest in time.
Parallel random coordinate descent method for composite minimization: Convergence analysis and error bounds
I. Necoara and D. Clipici · 2016
Closest in time.
Forward-backward quasi-newton methods for nonsmooth optimization problems
L. Stella, A. Themelis, and P. Patrinos · 2016
Closest in time.
New analysis of linear convergence of gradient-type methods via unifying error bound conditions
H. Zhang · 2016
Closest in time.