Fetching the paper…
Reading the bibliography…
We provide improved parallel approximation algorithms for the important class of packing and covering linear programs.
Some aspects of parallel and distributed iterative algorithms—A survey
Dimitri P. Bertsekas and John N. Tsitsiklis · 1991
Earlier work this paper cites.
Fast approximation algorithms for fractional packing and covering problems
Serge A. Plotkin, David B. Shmoys, and Éva Tardos · 1991
Earlier work this paper cites.
A parallel approximation algorithm for positive linear programming
Michael Luby and Noam Nisan · 1993
Earlier work this paper cites.
A parallel Gauss-Seidel method for block tridiagonal linear systems
Pierluigi Amodio and Francesca Mazzia · 1995
Earlier work this paper cites.
Sequential and parallel algorithms for mixed packing and covering
Neal E. Young · 2001
Earlier work this paper cites.
Iterative methods for sparse linear systems
Yousef Saad · 2003
Earlier work this paper cites.
A fast approximation scheme for fractional covering problems with variable upper bounds
Lisa Fleischer · 2004
Earlier work this paper cites.
Prox-method with rate of convergence O ( 1 / t ) O(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems
Arkadi Nemirovski · 2004
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yurii Nesterov · 2005
Earlier work this paper cites.
A coordinate gradient descent method for nonsmooth separable minimization
Paul Tseng and Sangwoon 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
Cited alongside, same era.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Cited alongside, same era.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yurii Nesterov · 2012
Cited alongside, same era.
Parallel coordinate descent methods for big data optimization
Peter Richtárik and Martin Takác · 2012
Cited alongside, same era.
Accelerated, parallel and proximal coordinate descent
Olivier Fercoq and Peter Richtárik · 2013
Cited alongside, same era.
Efficient first-order methods for linear programming and semidefinite programming
James Renegar · 2014
Later among the works it cites.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Peter Richtárik and Martin Takác · 2014
Later among the works it cites.
Neal E. Young · 2014
Later among the works it cites.
Linear coupling: An ultimate unification of gradient and mirror descent
Zeyuan Allen Zhu and Lorenzo Orecchia · 2014
Later among the works it cites.
Nearly-linear time positive LP solver with faster convergence rate
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems
Yin Tat Lee and Aaron Sidford · 2013
Cited alongside, same era.
Robust block coordinate descent
Kimon Fountoulakis and Rachael Tappenden · 2014
Cited alongside, same era.
A nearly linear-time PTAS for explicit fractional packing and covering linear programs
Christos Koufogiannakis and Neal E. Young · 2014
Cited alongside, same era.
An asynchronous parallel stochastic coordinate descent algorithm
Ji Liu, Steve J. Wright, Christopher Ré, Victor Bittorf, and Srikrishna Sridhar · 2014
Cited alongside, same era.
Zeyuan Allen-Zhu and Lorenzo Orecchia · 2015
Closest in time.
Using optimization to break the epsilon barrier: A faster and simpler width-independent algorithm for solving positive linear programs in parallel
Zeyuan Allen-Zhu and Lorenzo Orecchia · 2015
Closest in time.
Unified acceleration method for packing and covering problems via diameter reduction
Di Wang, Satish Rao, and Michael W. Mahoney · 2015
Closest in time.
Coordinate descent algorithms
Stephen J. Wright · 2015
Closest in time.
Using optimization to obtain a width-independent, parallel, simpler, and faster positive SDP solver
Zeyuan Allen Zhu, Yin Tat Lee, and Lorenzo Orecchia · 2015
Closest in time.