Fetching the paper…
Reading the bibliography…
TMAC is a toolbox written in C++11 that implements algorithms based on a set of modern methods for large-scale optimization.
The Numerical Solution of Parabolic and Elliptic Differential Equations
D. W. Peaceman and H. H. Rachford · 1955
Earlier work this paper cites.
On the numerical solution of heat conduction problems in two and three space variables
Jim Douglas and H. H. Rachford · 1956
Earlier work this paper cites.
A quadratic programming procedure
Clifford Hildreth · 1957
Earlier work this paper cites.
Minimizing certain convex functions
J. Warga · 1963
Earlier work this paper cites.
Chaotic relaxation
Daniel Chazan and Willard Miranker · 1969
Earlier work this paper cites.
On the convergence of sequential minimization algorithms
R. W. H. Sargent and D. J. Sebastian · 1973
Earlier work this paper cites.
On the approximation by finite elements of order one, and resolution, penalisation-duality for a class of nonlinear Dirichlet problems
Roland Glowinski and A. Marroco · 1975
Earlier work this paper cites.
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Daniel Gabay and Bertrand Mercier · 1976
Earlier work this paper cites.
Asynchronous iterative methods for multiprocessors
Gérard M Baudet · 1978
Earlier work this paper cites.
Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
Gregory B. Passty · 1979
Earlier work this paper cites.
Distributed asynchronous computation of fixed points
Dimitri P Bertsekas · 1983
Earlier work this paper cites.
Parallel and distributed computation: numerical methods
Dimitri P Bertsekas and John N Tsitsiklis · 1989
Earlier work this paper cites.
On the rate of convergence of a partially asynchronous gradient projection algorithm
Paul Tseng · 1991
Earlier work this paper cites.
On the convergence of the coordinate descent method for convex differentiable minimization
Z. Q. Luo and P. Tseng · 1992
Earlier work this paper cites.
Asynchronous multisplitting methods for nonlinear fixed point problems
Jacques Bahi, Jean-Claude Miellou, and Karim Rhofir · 1997
Earlier work this paper cites.
ScaLAPACK users’ guide , volume 4
L Susan Blackford, Jaeyoung Choi, Andy Cleary, Eduardo D’Azevedo, James Demmel, Inderjit Dhillon, Jack Dongarra, Sven Hammarling, Greg Henry, Antoine Petitet, et al · 1997
Earlier work this paper cites.
Flexible communication for parallel asynchronous methods with application to a nonlinear optimization problem
Didier El Baz, Didier Gazen, Mohamed Jarraya, Pierre Spiteri, and Jean Claude Miellou · 1998
Earlier work this paper cites.
Nonlinear Programming
Dimitri Bertsekas and Dimitri Bertsekas · 1999
Earlier work this paper cites.
On asynchronous iterations
Andreas Frommer and Daniel B Szyld · 2000
Earlier work this paper cites.
On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
L. Grippo and M. Sciandrone · 2000
Cited alongside, same era.
Distributed asynchronous incremental subgradient methods
A Nedić, Dimitri P Bertsekas, and Vivek S Borkar · 2001
Cited alongside, same era.
Feature selection, l 1 vs. l 2 regularization, and rotational invariance
Andrew Y Ng · 2004
Cited alongside, same era.
Asynchronous iterations with flexible communication: contracting operators
Didier El Baz, Andreas Frommer, and Pierre Spiteri · 2005
Cited alongside, same era.
A new alternating minimization algorithm for total variation image reconstruction
Yilun Wang, Junfeng Yang, Wotao Yin, and Yin Zhang · 2008
Cited alongside, same era.
The split Bregman method for L1-regularized problems
Tom Goldstein and Stanley Osher · 2009
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Peter Richtárik and Martin Takáč · 2014
Later among the works it cites.
Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
P. Combettes and J. Pesquet · 2015
Later among the works it cites.
A three-operator splitting scheme and its optimization applications
Damek Davis and Wotao Yin · 2015
Later among the works it cites.
Accelerated, parallel and proximal coordinate descent
Olivier Fercoq and Peter Richtárik · 2015
Later among the works it cites.
PASSCoDe: Parallel asynchronous stochastic dual co-ordinate descent
Cho-jui Hsieh, Hsiang-fu Yu, and Inderjit Dhillon · 2015
Later among the works it cites.
Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Coordinate descent optimization for ℓ 1 \ell^{1} minimization with application to compressed sensing; a greedy algorithm
Yingying Li and Stanley Osher · 2009
Cited alongside, same era.
Eigen v3
Gaël Guennebaud, Benoît Jacob, et al · 2010
Cited alongside, same era.
Templates for convex cone problems with applications to sparse signal recovery
Stephen R Becker, Emmanuel J Candès, and Michael C Grant · 2011
Cited alongside, same era.
Parallel Coordinate Descent for L1-Regularized Loss Minimization
Joseph K. Bradley, Aapo Kyrola, Danny Bickson, and Carlos Guestrin · 2011
Cited alongside, same era.
Hogwild: A lock-free approach to parallelizing stochastic gradient descent
Benjamin Recht, Christopher Re, Stephen Wright, and Feng Niu · 2011
Cited alongside, same era.
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
Yu. Nesterov · 2012
Cited alongside, same era.
Qia Li, Lixin Shen, Yuesheng Xu, and Na Zhang · 2015
Later among the works it cites.
Asynchronous stochastic coordinate descent: Parallelism and convergence properties
Ji Liu and Stephen J Wright · 2015
Later among the works it cites.
An asynchronous parallel stochastic coordinate descent algorithm
Ji Liu, Stephen J Wright, Christopher Ré, Victor Bittorf, and Srikrishna Sridhar · 2015
Later among the works it cites.
On the complexity analysis of randomized block-coordinate descent methods
Zhaosong Lu and Lin Xiao · 2015
Later among the works it cites.
Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection
Julie Nutini, Mark Schmidt, Issam H. Laradji, Michael Friedlander, and Hoyt Koepke · 2015
Later among the works it cites.
ARock: An algorithmic framework for asynchronous parallel coordinate updates
Zhimin Peng, Yangyang Xu, Ming Yan, and Wotao Yin · 2015
Later among the works it cites.
Convex programming with fast proximal and linear operators
Matt Wytock, Po-Wei Wang, and J Zico Kolter · 2015
Later among the works it cites.
A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
Peijun Chen, Jianguo Huang, and Xiaoqun Zhang · 2016
Closest in time.
The Asynchronous PALM Algorithm for Nonsmooth Nonconvex Problems
D. Davis · 2016
Closest in time.
Some facts about operator-splitting and alternating direction methods
Roland Glowinski, Tsorng-Whay Pan, and Xue-Cheng Tai · 2016
Closest in time.
Conic optimization via operator splitting and homogeneous self-dual embedding
B. O’Donoghue, E. Chu, N. Parikh, and S. Boyd · 2016
Closest in time.
Coordinate friendly structures, algorithms and applications
Zhimin Peng, Tianyu Wu, Yangyang Xu, Ming Yan, and Wotao Yin · 2016
Closest in time.
Parallel coordinate descent methods for big data optimization
Peter Richtárik and Martin Takáč · 2016
Closest in time.