Approximate Solutions of Linear Systems at a Universal Rate
From MaRDI portal
Publication:6053419
DOI10.1137/22m1517196zbMath1529.15003arXiv2207.03388OpenAlexW4387047842MaRDI QIDQ6053419
Publication date: 18 October 2023
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.03388
Geometric probability and stochastic geometry (60D05) Eigenvalues, singular values, and eigenvectors (15A18) Perturbation theory of linear operators (47A55) Iterative numerical methods for linear systems (65F10) Randomized algorithms (68W20) Linear equations (linear algebraic aspects) (15A06)
Cites Work
- Two-subspace projection method for coherent overdetermined systems
- Randomized block Kaczmarz method with projection for solving least squares
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- On convergence rate of the randomized Kaczmarz method
- On Motzkin's method for inconsistent linear systems
- On the regularization effect of stochastic gradient descent applied to least-squares
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- On the rate of convergence of the alternating projection method in finite dimensional spaces
- 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
- Randomized Iterative Methods for Linear Systems
- Preasymptotic convergence of randomized Kaczmarz method
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- A weighted randomized Kaczmarz method for solving linear systems
- Randomized Kaczmarz Converges Along Small Singular Vectors
- Surrounding the solution of a linear system of equations from all sides
- On Adaptive Sketch-and-Project for Solving Linear Systems
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations
- Stochastic Gradient Descent for Linear Systems with Missing Data
- Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Quantile-based Random Kaczmarz for corrupted linear systems of equations
- An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
