Linear convergence of first order methods for non-strongly convex optimization

A.J. Hoffman, On approximate solutions of systems of linear inequalities

1952

Earlier work this paper cites.

Z.-Q. Luo and P. Tseng, Error bounds and convergence analysis of feasible descent methods: a general approach

1993

Earlier work this paper cites.

D. Klatte and G. Thiere, Error bounds for solutions of linear equations and inequalities

1995

Earlier work this paper cites.

A.S. Lewis and J.S. Pang, Error bounds for convex inequality systems

1998

Earlier work this paper cites.

Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course

2004

Earlier work this paper cites.

J.V. Burke and S. Deng, Weak sharp minima revisited, Part III: error bounds for differentiable convex inclusions

2009

Earlier work this paper cites.

A. Nemirovski, A. Juditsky, G. Lan and A. Shapiro, Robust stochastic approximation approach to stochastic programming

2009

Cited alongside, same era.

D. Leventhal and A.S. Lewis, Randomized methods for linear constraints: convergence rates and conditioning

2010

Cited alongside, same era.

B. O’Donoghue and E. Candes, Adaptive restart for accelerated gradient schemes

2013

Cited alongside, same era.

P.W. Wang and C.J. Lin, Iteration complexity of feasible descent methods for convex optimization

2014

Cited alongside, same era.

S. Bubeck, Convex optimization: algorithms and complexity

2015

Cited alongside, same era.

A. Beck and S. Shtern, Linearly convergent away-step conditional gradient for non-strongly convex functions

J. Liu, S. Wright, C. Re, V. Bittorf and S. Sridhar, An asynchronous parallel stochastic coordinate descent algorithm

2015

Closest in time.

T. Yangy and Q. Lin, A stochastic gradient method with linear convergence rate for a class of non-smooth non-strongly convex optimization

2015

Closest in time.

H. Zhang and L. Cheng, Restricted strong convexity and its applications to convergence analysis of gradient type methods in convex optimization

2015

Closest in time.

S. Wright, Coordinate descent algorithms

Original

2015

Closest in time.

I. Necoara and D. Clipici, Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds

2016

Closest in time.