Fetching the paper…
Reading the bibliography…
The restricted strong convexity is an effective tool for deriving globally linear convergence rates of descent methods in convex minimization.
On approximate solutions of systems of linear inequalities
A. J. Hoffman · 1952
Earlier work this paper cites.
Bounds for error in the solution set of a perturbed linear program
S. M. Robinson · 1973
Earlier work this paper cites.
Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems
O. L. Mangasarian and T.-H. Shiau · 1987
Earlier work this paper cites.
On the linear convergence of descent methods for convex essentially smooth minimization
Z. Q. Luo and P. Tseng · 1992
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Y. Nesterov · 2004
Earlier work this paper cites.
Nonlinear optimization
A. P. Ruszczyński · 2006
Earlier work this paper cites.
Characterization of metric regularity of subdifferentials
F. J. Arag o ´ \acute{o} n Artacho and M. H. Geoffroy · 2008
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems.
A. Beck and M. Teboulle · 2009
Cited alongside, same era.
Augmented ℓ 1 \ell_{1} and nuclear-norm models with a globally linearly convergent algorithm
M. J. Lai and W. T. Yin · 2013
Cited alongside, same era.
A.M.-C. So · 2013
Cited alongside, same era.
Gradient methods for convex minimization: better rates under weaker conditions
H. Zhang and W. T. Yin · 2013
Cited alongside, same era.
Iteration complexity of feasiable decent methods for convex optimization
P. Wang and C. Lin · 2014
Cited alongside, same era.
Linearly Convergent Away-Step Conditional Gradient for Non-strongly Convex Functions
Linear Convergence of Variance-Reduced Stochastic Gradient without Strong Convexity
P. H. Gong, J. P. Ye · 2015
Closest in time.
Asynchronous stochastic coordinate descent: Parallelism and convergence properties
J. Liu and S. J. Wright · 2015
Closest in time.
Linear convergence of first order methods for non-strongly convex programming
I. Necoara, Y. Nesterov, and F. Glineur · 2015
Closest in time.
Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
F. Sch o ¨ \ddot{o} pfer · 2015
Closest in time.
Restricted strong convexity and its applications to convergence analysis of gradient-type methods
H. Zhang and L. Z. Cheng · 2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Beck and S. Shtern · 2015
Cited alongside, same era.
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
Cited alongside, same era.
Z. R. Zhou and A.M.-C. So · 2015
Closest in time.
Error bounds, quadratic growth, and linear convergence of proximal methods
D. Drusvyatskiy A. S. Lewis · 2016
Closest in time.