Fetching the paper…
Reading the bibliography…
In this paper we analyze the randomized block-coordinate descent (RBCD) methods proposed in [8,11] for minimizing the sum of a smooth convex function and a block-separable convex function.
Convergence of a block coordinate descent method for nondifferentiable minimization
P. Tseng · 2001
Earlier work this paper cites.
On the convergence of the coordinate descent method for convex differentiable minimization
Z. Q. Luo and P. Tseng · 2002
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2004
Earlier work this paper cites.
Gradient methods for minimizing composite objective function
Y. Nesterov · 2007
Earlier work this paper cites.
Coordinate descent method for large-scale l 2 l_{2} -loss linear support vector machines
K.-W. Chang, C.-J. Hsieh, and C.-J. Lin · 2008
Earlier work this paper cites.
A dual coordinate descent method for large-scale linear SVM
C.-J. Hsieh, K.-W. Chang, C.-J. Lin, S. Keerthi, and S. Sundararajan · 2008
Earlier work this paper cites.
Coordinate descent algorithms for lasso penalized regression
T. Wu and K. Lange · 2008
Earlier work this paper cites.
Coordinate descent optimization for l 1 l_{1} minimization with application to compressed sensing; a greedy algorithm
Y. Li and S. Osher · 2009
Earlier work this paper cites.
Stochastic methods for l 1 l_{1} regularized loss minimization
S. Shalev-Shwartz and A. Tewari · 2009
Cited alongside, same era.
Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
P. Tseng and S. Yun · 2009
Cited alongside, same era.
A coordinate gradient descent method for nonsmooth separable minimization
P. Tseng and S. Yun · 2009
Cited alongside, same era.
Randomized methods for linear constraints: convergence rates and conditioning
D. Leventhal and A. S. Lewis · 2010
Cited alongside, same era.
Effiient block-coordinate descent algorithms for the group lasso
Z. Qin, K. Scheinberg, and D. Goldfarb · 2010
Cited alongside, same era.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
P. Richtárik and M. Takáč · 2011
Efficient serial and parallel coordinate descent method for huge-scale truss topology design
P. Richtárik and M. Takáč · 2012
Later among the works it cites.
Parallel coordinate descent methods for big data optimization
P. Richtárik and M. Takáč · 2012
Later among the works it cites.
Proximal stochastic dual coordinate ascent
S. Shalev-Shwartz and T. Zhang · 2012
Later among the works it cites.
Block coordinate descent methods for semidefinite programming
Z. Wen, D. Goldfarb, and K. Scheinberg · 2012
Later among the works it cites.
Accelerated block-coordinate relaxation for regularized optimization
S. J. Wright · 2012
Later among the works it cites.
On the non-asymptotic convergence of cyclic coordinate descent methods
A. Saha and A. Tewari · 2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A coordinate gradient descent method for l 1 l_{1} -regularized convex minimization
S. Yun and K.-C. Toh · 2011
Cited alongside, same era.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 2012
Cited alongside, same era.
Inexact coordinate descent: complexity and preconditioning
R. Tappenden, P. Richtárik and J. Gondzio · 2013
Closest in time.