Fetching the paper…
Reading the bibliography…
The design and complexity analysis of randomized coordinate descent methods, and in particular of variants which update a random subset (sampling) of coordinates in each iteration, depends on the notion of expected separable overapproximation (ESO).
Topics in matrix analysis
Roger A. Horn and Charles R. Johnson · 1991
Earlier work this paper cites.
Convergence of a block coordinate descent method for nondifferentiable minimization
Paul Tseng · 2001
Earlier work this paper cites.
A coordinate gradient descent method for nonsmooth separable minimization
Z. Q. Luo and Paul Tseng · 2002
Earlier work this paper cites.
Cyclic coordinate descent: A robotics algorithm for protein loop closure
Adrian A. Canutescu and Roland L. Dunbrack · 2003
Earlier work this paper cites.
Coordinate descent algorithms for lasso penalized regression
Tong Tong Wu and Kenneth Lange · 2008
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.
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.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yurii Nesterov · 2012
Earlier work this paper cites.
Efficient serial and parallel coordinate descent method for huge-scale truss topology design
Peter Richtárik and Martin Takáč · 2012
Earlier work this paper cites.
Accelerated, parallel and proximal coordinate descent
Olivier Fercoq and Peter Richtárik · 2013
Earlier work this paper cites.
Smooth minimization of nonsmooth functions by parallel coordinate descent
Olivier Fercoq and Peter Richtárik · 2013
Earlier work this paper cites.
Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems
Yin Tat Lee and Aaron Sidford · 2013
Cited alongside, same era.
An asynchronous parallel stochastic coordinate descent algorithm
Ji Liu, Stephen J. Wright, Christopher Ré, Victor Bittorf, and Srikrishna Sridhar · 2013
Cited alongside, same era.
On the complexity analysis of randomized block-coordinate descent methods
Zhaosong Lu and Lin Xiao · 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
Universal coordinate descent methods
Olivier Fercoq and Peter Richtárik · 2014
Closest in time.
An accelerated proximal coordinate gradient method and its application to regularized empirical risk minimization
Qihang Lin, Zhaosong Lu, and Lin Xiao · 2014
Closest in time.
Asynchronous stochastic coordinate descent: Parallelism and convergence properties
Ji Liu and Stephen J. Wright · 2014
Closest in time.
A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
Ion Necoara and Andrei Patrascu · 2014
Closest in time.
Coordinate descent methods with arbitrary sampling I: Algorithms and complexity
Zheng Qu and Peter Richtárik · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Peter Richtárik and Martin Takáč · 2013
Cited alongside, same era.
Accelerated mini-batch stochastic dual coordinate ascent
Shai Shalev-Shwartz and Tong Zhang · 2013
Cited alongside, same era.
Stochastic dual coordinate ascent methods for regularized loss
Shai Shalev-Shwartz 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
Cited alongside, same era.
Inexact block coordinate descent method: complexity and preconditioning
Rachael Tappenden, Peter Richtárik, and Jacek Gondzio · 2013
Cited alongside, same era.
Accelerated, parallel and proximal coordinate descent for strongly convex functions
Olivier Fercoq, Zheng Qu, and Peter Richtárik · 2014
Cited alongside, same era.
Fast distributed coordinate descent for minimizing non-strongly convex losses
Olivier Fercoq, Zheng Qu, Peter Richtárik, and Martin Takáč · 2014
Cited alongside, same era.
Zheng Qu, Peter Richtárik, and Tong Zhang · 2014
Closest in time.
Randomized coordinate descent for big data optimization (theory)
Peter Richtárik · 2014
Closest in time.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Peter Richtárik and Martin Takáč · 2014
Closest in time.
Separable approximations and decomposition methods for the augmented lagrangian
Rachael Tappenden, Peter Richtárik, and Burak Büke · 2014
Closest in time.
Stochastic optimization with importance sampling
Peilin Zhao and Tong Zhang · 2014
Closest in time.
Parallel coordinate descent methods for big data optimization
Peter Richtárik and Martin Takáč · 2015
Closest in time.