Iterative Methods for Solving Factorized Linear Systems
From MaRDI portal
Publication:3130425
DOI10.1137/17M1115678zbMath1381.65032arXiv1701.07453OpenAlexW2963981889MaRDI QIDQ3130425
Aaditya Ramdas, Deanna Needell, Anna Ma
Publication date: 22 January 2018
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.07453
convergencenumerical exampleGauss-Seidel methodrandomized Kaczmarz methodfactorized linear systemsrandomized iterative algorithms
Related Items
A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems, A new randomized Kaczmarz based kernel canonical correlation analysis algorithm with applications to information retrieval, Accelerated greedy randomized augmented Kaczmarz algorithm for inconsistent linear systems, A randomised iterative method for solving factorised linear systems, Splitting-based randomized iterative methods for solving indefinite least squares problem, A doubly stochastic block Gauss-Seidel algorithm for solving linear equations, On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems, Randomized double and triple Kaczmarz for solving extended normal equations, On relaxed greedy randomized iterative methods for the solution of factorized linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Comments on the randomized Kaczmarz method
- Exact matrix completion via convex optimization
- The Mathematics of Computerized Tomography
- Fundamentals of Computerized Tomography
- Randomized Extended Kaczmarz for Solving Least Squares
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- Low-rank matrix completion using alternating minimization
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm