Fetching the paper…
Reading the bibliography…
There has been significant recent work on the theory and application of randomized coordinate descent algorithms, beginning with the work of Nesterov [SIAM J.
The nature and use of the harmonic mean
W. F. Ferger · 1931
Earlier work this paper cites.
Five balltree construction algorithms
S. M. Omohundro · 1989
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.
Inducing features of random fields
S. Della Pietra, V. Della Pietra, and J. Lafferty · 1997
Earlier work this paper cites.
Nonlinear Programming
D. P. Bertsekas · 1999
Earlier work this paper cites.
Introduction to Algorithms
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein · 2001
Earlier work this paper cites.
On the convergence of leveraging
G. Rätsch, S. Mika, and M. K. Warmuth · 2001
Earlier work this paper cites.
A simple and efficient algorithm for gene selection using sparse logistic regression
S. K. Shevade and S. S. Keerthi · 2003
Earlier work this paper cites.
Convex Optimization
S. P. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2004
Earlier work this paper cites.
Learning with local and global consistency
D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Schölkopf · 2004
Earlier work this paper cites.
Gaussian Markov Random Fields: Theory and Applications
H. Rue and L. Held · 2005
Earlier work this paper cites.
Label propagation and quadratic criterion
Y. Bengio, O. Delalleau, and N. Le Roux · 2006
Cited alongside, same era.
Efficient structure learning of Markov networks using ℓ 1 \ell_{1} -regularization
S.-I. Lee, V. Ganapathi, and D. Koller · 2006
Cited alongside, same era.
Greedy block coordinate descent for large scale gaussian process regression
L. Bo and C. Sminchisescu · 2008
Cited alongside, same era.
A dual coordinate descent method for large-scale linear SVM
C.-J. Hsieh, K.-W. Chang, C.-J. Lin, S. S. Keerthi, and S. Sundararajan · 2008
Cited alongside, same era.
Coordinate descent algorithms for lasso penalized regression
T. T. Wu and K. Lange · 2008
Cited alongside, same era.
Coordinate descent optimization for ℓ 1 \ell_{1} minimization with application to compressed sensing; a greedy algorithm
Y. Li and S. Osher · 2009
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 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 convergence of block coordinate descent type methods
A. Beck and L. Tetruashvili · 2013
Later among the works it cites.
Accelerated, parallel and proximal coordinate descent
O. Fercoq and P. Richtárik · 2013
Later among the works it cites.
Stochastic dual coordinate ascent methods for regularized loss minimization
S. Shalev-Shwartz and T. Zhang · 2013
Later among the works it cites.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
SINCO - a greedy coordinate ascent method for sparse inverse covariance selection problem
K. Scheinberg and I. Rish · 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.
Nearest neighbor based greedy coordinate descent
I. S. Dhillon, P. K. Ravikumar, and A. Tewari · 2011
Cited alongside, same era.
Hybrid deterministic-stochastic methods for data fitting
M. P. Friedlander and M. Schmidt · 2012
Cited alongside, same era.
Convergence rate analysis of MAP coordinate minimization algorithms
O. Meshi, T. Jaakkola, and A. Globerson · 2012
Cited alongside, same era.
P. Richtárik and M. Takáč · 2014
Later among the works it cites.
Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS)
A. Shrivastava and P. Li · 2014
Later among the works it cites.
On convergence of the maximum block improvement method
Z. Li, A. Uschmajew, and S. Zhang · 2015
Closest in time.
Parallel coordinate descent methods for big data optimization
P. Richtárik and M. Takáč · 2015
Closest in time.
J. Nutini, I. Laradji, and M. Schmidt · 2017
Closest in time.
Accelerated stochastic greedy coordinate descent by soft thresholding projection onto simplex
C. Song, S. Cui, Y. Jiang, and S.-T. Xia · 2017
Closest in time.
Greed is Good
J. Nutini · 2018
Closest in time.