Fetching the paper…
Reading the bibliography…
In this work we study the parallel coordinate descent method (PCDM) proposed by Richt\'arik and Tak\'a\v{c} [26] for minimizing a regularized convex function.
Convergence of block coordinate descent method for nondifferentiable minimization
P. Tseng · 2001
Earlier work this paper cites.
Gradient methods for minimizing composite objective function
Yurii Nesterov · 2007
Earlier work this paper cites.
A dual coordinate descent method for large-scale linear svm
Cho-Jui Hsieh, Kai-Wei Chang, Chih-Jen Lin, S Sathiya Keerthi, and S Sundararajan · 2008
Earlier work this paper cites.
Coordinate descent algorithms for lasso penalized regression
Tong Tong Wu and Kenneth Lange · 2008
Earlier work this paper cites.
Coordinate descent optimization for
Yingying Li and Stanley Osher · 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.
Parallel coordinate descent for L1-regularized loss minimization
Joseph K. Bradley, Aapo Kyrola, Danny Bickson, and Carlos Guestrin · 2011
Earlier work this paper cites.
Pegasos: Primal Estimated sub-Gradient SOlver for SVM
Shai Shalev-Shwartz, Yoram Singer, Nati Srebro, and Andrew Cotter · 2011
Earlier work this paper cites.
Efficiency of randomized coordinate descent methods on optimization problems with linearly coupled constraints
Ion Necoara, Yurii Nesterov, and Francois Glineur · 2012
Earlier work this paper cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yurii Nesterov · 2012
Earlier work this paper cites.
Efficient serial and parallel coordinate descent methods for huge-scale truss topology design
Peter Richtárik and Martin Takáč · 2012
Earlier work this paper cites.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Peter Richtárik and Martin Takáč · 2012
Earlier work this paper cites.
Parallel coordinate descent methods for big data optimization
Peter Richtárik and Martin Takáč · 2012
Earlier work this paper cites.
Stochastic coordinate descent methods for regularized smooth and nonsmooth losses
Q. Tao, K. Kong, D. Chu, and G. Wu · 2012
Cited alongside, same era.
Accelerated block-coordinate relaxation for regularized optimization
Stephen Wright · 2012
Cited alongside, same era.
Accelerated, Parallel and Proximal Coordinate Descent
Olivier Fercoq and Peter Richtárik · 2013
Cited alongside, same era.
Smooth minimization of nonsmooth functions by parallel coordinate descent
Olivier Fercoq and Peter Richtárik · 2013
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Cited alongside, same era.
Mini-batch primal and dual methods for SVMs
Martin Takáč, Avleen Bijral, Peter Richtárik, and Nathan Srebro · 2013
Later among the works it cites.
Inexact coordinate descent: Complexity and preconditioning
Rachael Tappenden, Peter Richtárik, and Jacek Gondzio · 2013
Later among the works it cites.
On the complexity analysis of randomized block-coordinate descent methods
Lin Xiao and Zhaosong Lu · 2013
Later among the works it cites.
Fast distributed coordinate descent for non-strongly convex losses
Olivier Fercoq, Zheng Qu, Peter Richtárik, and Martin Takáč · 2014
Later among the works it cites.
Communication-efficient distributed dual coordinate ascent
Martin Jaggi, Virginia Smith, Martin Takác, Jonathan Terhorst, Sanjay Krishnan, Thomas Hofmann, and Michael I Jordan · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jakub Konečný and Peter Richtárik · 2013
Cited alongside, same era.
An asynchronous parallel stochastic coordinate descent algorithm
Ji Liu, Stephen J Wright, Christopher Ré, and Victor Bittorf · 2013
Cited alongside, same era.
Mixed optimization for smooth functions
Mehrdad Mahdavi, Lijun Zhang, and Rong Jin · 2013
Cited alongside, same era.
Distributed coordinate descent methods for composite minimization
Ion Necoara and Dragos Clipici · 2013
Cited alongside, same era.
Distributed coordinate descent method for learning with big data
Peter Richtárik and Martin Takáč · 2013
Cited alongside, same era.
On optimal probabilities in stochastic coordinate descent methods
Peter Richtárik and Martin Takáč · 2013
Cited alongside, same era.
On the nonasymptotic convergence of cyclic coordinate descent methods
Ankan Saha and Ambuj Tewari · 2013
Cited alongside, same era.
An accelerated proximal coordinate gradient method
Qihang Lin, Zhaosong Lu, and Lin Xiao · 2014
Later among the works it cites.
Distributed block coordinate descent for minimizing partially separable functions
Jakub Mareček, Peter Richtárik, and Martin Takáč · 2014
Later among the works it cites.
Coordinate descent with arbitrary sampling I: Algorithms and complexity
Zheng Qu and Peter Richtárik · 2014
Later among the works it cites.
Coordinate descent with arbitrary sampling II: Expected separable overapproximation
Zheng Qu and Peter Richtárik · 2014
Later among the works it cites.
Randomized dual coordinate ascent with arbitrary sampling
Zheng Qu, Peter Richtárik, and Tong Zhang · 2014
Later among the works it cites.
Coordinate descent converges faster with the Gauss-Southwell rule than random selection
Mark Schmidt and Michael Friedlander · 2014
Later among the works it cites.
Adding vs. averaging in distributed primal-dual optimization
Chenxin Ma, Virginia Smith, Martin Jaggi, Michael I Jordan, Peter Richtárik, and Martin Takáč · 2015
Closest in time.
Coordinate descent algorithms
Stephen J Wright · 2015
Closest in time.