Fetching the paper…
Reading the bibliography…
Recent several years have witnessed the surge of asynchronous (async-) parallel computing methods due to the extremely big data involved in many modern applications and also the advancement of multi-core machines and computer clusters.
Portfolio selection
H. Markowitz · 1952
Earlier work this paper cites.
Chaotic relaxation
D. Chazan and W. Miranker · 1969
Earlier work this paper cites.
Parallel and distributed computation: numerical methods
D. P. Bertsekas and J. N. Tsitsiklis · 1989
Earlier work this paper cites.
On the rate of convergence of a partially asynchronous gradient projection algorithm
P. Tseng · 1991
Earlier work this paper cites.
Support-vector networks
C. Cortes and V. Vapnik · 1995
Earlier work this paper cites.
Atomic decomposition by basis pursuit
S. S. Chen, D. L. Donoho, and M. A. Saunders · 2001
Earlier work this paper cites.
Convergence of a block coordinate descent method for nondifferentiable minimization
P. Tseng · 2001
Earlier work this paper cites.
Fast training support vector machines using parallel sequential minimal optimization
Z.-Q. Zeng, H.-B. Yu, H.-R. Xu, Y.-Q. Xie, and J. Gao · 2008
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.
Hogwild: A lock-free approach to parallelizing stochastic gradient descent
B. Recht, C. Re, S. Wright, and F. Niu · 2011
Earlier work this paper cites.
YALL1: Your algorithms for l 1 l_{1}
Y. Zhang, J. Yang, and W. Yin · 2011
Earlier work this paper cites.
A note on the alternating direction method of multipliers
D. Han and X. Yuan · 2012
Earlier work this paper cites.
Alternating direction method with gaussian back substitution for separable convex programming
B. He, M. Tao, and X. Yuan · 2012
Earlier work this paper cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 2012
Earlier work this paper cites.
Penalized and constrained regression
G. M. James, C. Paulson, and P. Rusmevichientong · 2013
Earlier work this paper cites.
A unified convergence analysis of block successive minimization methods for nonsmooth optimization
M. Razaviyayn, M. Hong, and Z.-Q. Luo · 2013
Earlier work this paper cites.
On the o ( 1 / k ) o(1/k) convergence of asynchronous distributed alternating direction method of multipliers
E. Wei and A. Ozdaglar · 2013
Earlier work this paper cites.
A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
Y. Xu and W. Yin · 2013
Cited alongside, same era.
M. Hong, T.-H. Chang, X. Wang, M. Razaviyayn, S. Ma, and Z.-Q. Luo · 2014
Cited alongside, same era.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
P. Richtárik and M. Takáč · 2014
Cited alongside, same era.
Big Data: Seizing Opportunities Preserving Values
WhiteHouse · 2014
Cited alongside, same era.
Asynchronous distributed admm for consensus optimization
R. Zhang and J. Kwok · 2014
Cited alongside, same era.
Asynchronous distributed admm for large-scale optimization — part ii: Linear convergence analysis and numerical performance
T.-H. Chang, W.-C. Liao, M. Hong, and X. Wang · 2016
Later among the works it cites.
The direct extension of admm for multi-block convex minimization problems is not necessarily convergent
C. Chen, B. He, Y. Ye, and X. Yuan · 2016
Later among the works it cites.
Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
P. L. Combettes and J. Eckstein · 2016
Later among the works it cites.
Randomized primal-dual proximal block coordinate updates
X. Gao, Y. Xu, and S. Zhang · 2016
Later among the works it cites.
A schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
X. Li, D. Sun, and K.-C. Toh · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Convergence analysis of l-admm for multi-block linear-constrained separable convex minimization problem
J.-K. Feng, H.-B. Zhang, C.-Z. Cheng, and H.-M. Pei · 2015
Cited alongside, same era.
On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
B. He, L. Hou, and X. Yuan · 2015
Cited alongside, same era.
A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block
M. Li, D. Sun, and K.-C. Toh · 2015
Cited alongside, same era.
On the global linear convergence of the admm with multiblock variables
T. Lin, S. Ma, and S. Zhang · 2015
Cited alongside, same era.
On the sublinear convergence rate of multi-block admm
T. Lin, S. Ma, and S. Zhang · 2015
Cited alongside, same era.
Asynchronous stochastic coordinate descent: Parallelism and convergence properties
J. Liu and S. J. Wright · 2015
Cited alongside, same era.
An asynchronous parallel stochastic coordinate descent algorithm
J. Liu, S. J. Wright, C. Ré, V. Bittorf, and S. Sridhar · 2015
Cited alongside, same era.
Coordinate friendly structures, algorithms and applications
Z. Peng, T. Wu, Y. Xu, M. Yan, and W. Yin · 2016
Later among the works it cites.
ARock: An algorithmic framework for asynchronous parallel coordinate updates
Z. Peng, Y. Xu, M. Yan, and W. Yin · 2016
Later among the works it cites.
On the convergence of asynchronous parallel iteration with arbitrary delays
Z. Peng, Y. Xu, M. Yan, and W. Yin · 2016
Later among the works it cites.
On the convergence of the direct extension of admm for three-block separable convex minimization models with one strongly convex function
X. Cai, D. Han, and X. Yuan · 2017
Closest in time.
A three-operator splitting scheme and its optimization applications
D. Davis and W. Yin · 2017
Closest in time.
Parallel multi-block ADMM with o ( 1 / k ) o(1/k) convergence
W. Deng, M.-J. Lai, Z. Peng, and W. Yin · 2017
Closest in time.
First-order algorithms for convex optimization with nonseparable objective and coupled constraints
X. Gao and S. Zhang · 2017
Closest in time.
Convergence rate analysis for the alternating direction method of multipliers with a substitution procedure for separable convex programming
B. He, M. Tao, and X. Yuan · 2017
Closest in time.
Iteration complexity analysis of block coordinate descent methods
M. Hong, X. Wang, M. Razaviyayn, and Z.-Q. Luo · 2017
Closest in time.
A globally convergent algorithm for nonconvex optimization based on block coordinate update
Y. Xu and W. Yin · 2017
Closest in time.
Hybrid jacobian and gauss–seidel proximal block coordinate update methods for linearly constrained convex programming
Y. Xu · 2018
Closest in time.