Fetching the paper…
Reading the bibliography…
In this paper we consider the problem of minimizing a convex function using a randomized block coordinate descent method.
Methods of conjugate gradients for solving linear systems
M. R. Hestenes and E. Steifel · 1952
Earlier work this paper cites.
Matrix Analysis
R. A. Horn and C. R. Johnson · 1985
Earlier work this paper cites.
Matrix Computations
G. H. Golub and C. F. van Loan · 1986
Earlier work this paper cites.
An interior point method for block angular optimization
G. L. Schultz and R. R. Meyer · 1991
Earlier work this paper cites.
Inexact preconditioned conjugate gradient method with inner-outer iteration
G. H. Golub and Q. Ye · 1999
Earlier work this paper cites.
Matrix Theory: Basic Results and Techniques
F. Zhang · 1999
Earlier work this paper cites.
Convergence of block coordinate descent method for nondifferentiable minimization
P. Tseng · 2001
Earlier work this paper cites.
Parallel interior-point solver for structured linear programs
J. Gondzio and R. Sarkissian · 2003
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2004
Earlier work this paper cites.
Numerical solution of saddle point problems
M. Benzi, G. H. Golub, and J. Liesen · 2005
Earlier work this paper cites.
Compressed sensing
D. Donoho · 2006
Earlier work this paper cites.
Gradient methods form minimizing composite objective function
Y. Nesterov · 2007
Earlier work this paper cites.
A randomized Kaczmarz algorithm with exponential convergence
T. Strohmer and R. Vershynin · 2009
Earlier work this paper cites.
A coordinate gradient descent method for nonsmooth separable minimization
P. Tseng and S. Yun · 2009
Earlier work this paper cites.
Sparse reconstruction by separable approximation
S. J. Wright, R. D. Nowak, and M. A. T. Figueiredo · 2009
Earlier work this paper cites.
Randomized methods for linear constraints: Convergence rates and conditioning
D. Leventhal and A. S. Lewis · 2010
Cited alongside, same era.
Randomized Kaczmarz solver for noisy linear systems
D. Needell · 2010
Cited alongside, same era.
Efficient block-coordinate descent algorithms for the group lasso
Z. Qin, K. Scheinberg, and D. Goldfarb · 2010
Cited alongside, same era.
On the finite time convergence of cyclic coordinate descent methods
A. Saha and A. Tewari · 2010
Cited alongside, same era.
Inexact block coordinate descent methods with application to non-negative matrix factorization
S. Bonettini · 2011
Cited alongside, same era.
A box-constrained gradient projection algorithm for compressed sensing
An inexact coordinate descent method for the weighted l 1 l_{1} -regularized convex optimization problem
X. Hua and N. Yamashita · 2012
Later among the works it cites.
Optimal computational trade-off of inexact proximal methods
P. Machart, S. Anthoine, and L. Baldassarre · 2012
Later among the works it cites.
Inexact dual gradient methods with guaranteed primal feasibility: application to distributed MPC
I. Necoara and V. Nedelcu · 2012
Later among the works it cites.
Efficiency of randomized coordinate descent methods on optimization problems with linearly coupled constraints
I. Necoara, Y. Nesterov, and F. Glineur · 2012
Later among the works it cites.
A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
I. Necoara and A. Patrascu · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Broughton, I. Coope, P. Renaud, and R. Tappenden · 2011
Cited alongside, same era.
Quadratic regularizations in an interior-point method for primal block-angular problems
J. Castro and J. Cuesta · 2011
Cited alongside, same era.
The University of Florida sparse matrix collection
T. A. Davis and Y. Hu · 2011
Cited alongside, same era.
On a class of limited memory preconditioners for large scale linear systems with multiple right-hand sides
S. Gratton, A. Sartenaer, and J. Tshimanga · 2011
Cited alongside, same era.
Parallel stochastic gradient algorithms for large-scale matrix completion
B. Recht and C. Ré · 2011
Cited alongside, same era.
Efficiency of randomized coordinate descent methods on minimization problems with a composite objective function
P. Richtárik and M. Takáč · 2011
Cited alongside, same era.
Convergence rates of inexact proximal-gradient methods for convex optimization
M. Schmidt, N. Le Roux, and F. Bach · 2011
Cited alongside, same era.
D. Needell and J. Tropp · 2012
Later among the works it cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 2012
Later among the works it cites.
Efficient serial and parallel coordinate descent methods for huge-scale truss topology design
P. Richtárik and M. Takáč · 2012
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áč · 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.
Stochastic coordinate descent methods for regularized smooth and nonsmooth losses
Q. Tao, K. Kong, D. Chu, and G. Wu · 2012
Later among the works it cites.
Accelerated block-coordinate relaxation for regularized optimization
S. J. Wright · 2012
Later among the works it cites.
Stochastic dual coordinate ascent methods for regularized loss minimization
S. Shalev-Schwartz and T. Zhang · 2013
Closest in time.
Mini-batch primal and dual methods for SVMs
M. Takáč, A. Bijral, P. Richtárik, and N. Srebro · 2013
Closest in time.