Avoiding Communication in Primal and Dual Block Coordinate Descent Methods
From MaRDI portal
Publication:4613501
DOI10.1137/17M1134433OpenAlexW2565516521MaRDI QIDQ4613501
Aditya Devarakonda, Michael W. Mahoney, Kimon Fountoulakis, James W. Demmel
Publication date: 1 February 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.04003
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- s-step iterative methods for symmetric linear systems
- An efficient nonsymmetric Lanczos method on parallel vector computers
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- An efficient deflation technique for the communication-avoiding conjugate gradient
- Coordinate descent algorithms
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods
- A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of $s$-Step Krylov Subspace Methods
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Implementation of the GMRES Method Using Householder Transformations
- Expected Length of the Longest Probe Sequence in Hash Code Searching
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
- A survey of direct methods for sparse linear systems
