Fetching the paper…
Reading the bibliography…
In this work we show that randomized (block) coordinate descent methods can be accelerated by parallelization when applied to the problem of minimizing the sum of a partially separable smooth convex function and a simple separable convex function.
Iterative methods by space decomposition and subspace correction
Jinchao Xu · 1992
Earlier work this paper cites.
On convergence of an augmented Lagrangian decomposition method for sparse convex optimization
Andrzej Ruszczynski · 1995
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course (Applied Optimization)
Yurii Nesterov · 2004
Earlier work this paper cites.
Coordinate descent optimization for l 1 l_{1} minimization with application to compressed sensing; a greedy algorithm
Yingying Li and Stanley Osher · 2009
Earlier work this paper cites.
A randomized Kaczmarz algorithm with exponential convergence
Thomas Strohmer and Roman Vershynin · 2009
Earlier work this paper cites.
Randomized methods for linear constraints: Convergence rates and conditioning
Dennis Leventhal and Adrian S. Lewis · 2010
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.
Nearest neighbor based greedy coordinate descent
Inderjit Dhillon, Pradeep Ravikumar, and Ambuj Tewari · 2011
Earlier work this paper cites.
Hogwild!: A lock-free approach to parallelizing stochastic gradient descent
Feng Niu, Benjamin Recht, Christopher Ré, and Stephen Wright · 2011
Earlier work this paper cites.
Efficiency of randomized coordinate descent methods on minimization problems with a composite objective function
Peter Richtárik and Martin Takáč · 2011
Earlier work this paper cites.
Stochastic methods for ℓ 1 \ell_{1} -regularized loss minimization
Shai Shalev-Shwartz and Ambuj Tewari · 2011
Cited alongside, same era.
Accelerated dual descent for network optimization
Michael Zargham, Alejandro Ribeiro, Asuman Ozdaglar, and Ali Jadbabaie · 2011
Cited alongside, same era.
Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC
Ion Necoara and Dragos Clipici · 2012
Cited alongside, same era.
Efficiency of randomized coordinate descent methods on optimization problems with linearly coupled constraints
Ion Necoara, Yurii Nesterov, and Francois Glineur · 2012
Cited alongside, same era.
A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
Ion Necoara and Andrei Patrascu · 2012
Cited alongside, same era.
Scalable coordinate descent approaches to parallel matrix factorization for recommender systems
H. F. Yu, C. J. Hsieh, S. Si, and I. Dhillon · 2012
Closest in time.
Smooth minimization of nonsmooth functions with parallel coordinate descent methods
Olivier Fercoq and Peter Richtárik · 2013
Closest in time.
Gradient methods for minimizing composite objective function
Yurii Nesterov · 2013
Closest in time.
Parallel and distributed sparse optimization
Zhimin Peng, Ming Yan, and Wotao Yin · 2013
Closest in time.
Distributed coordinate descent method for learning with big data
Peter Richtárik and Martin Takáč · 2013
Closest in time.
On optimal probabilities on stochastic coordinate descent methods
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Efficiency of coordinate descent methods on huge-scale optimization problems
Yurii Nesterov · 2012
Cited alongside, same era.
Subgradient methods for huge-scale optimization problems
Yurii Nesterov · 2012
Cited alongside, same era.
Efficient serial and parallel coordinate descent method for huge-scale truss topology design
Peter Richtárik and Martin Takáč · 2012
Cited alongside, same era.
Peter Richtárik and Martin Takáč · 2012
Cited alongside, same era.
Feature clustering for accelerating parallel coordinate descent
Chad Scherrer, Ambuj Tewari, Mahantesh Halappanavar, and David J Haglin · 2012
Cited alongside, same era.
Peter Richtárik and Martin Takáč · 2013
Closest in time.
On the nonasymptotic convergence of cyclic coordinate descent methods
Ankan Saha and Ambuj Tewari · 2013
Closest in time.
Mini-batch primal and dual methods for SVMs
Martin Takáč, Avleen Bijral, Peter Richtárik, and Nati Srebro · 2013
Closest in time.
Inexact coordinate descent: complexity and preconditioning
Rachael Tappenden, Peter Richtárik, and Jacek Gondzio · 2013
Closest in time.