A weighted randomized Kaczmarz method for solving linear systems
From MaRDI portal
Publication:4956926
DOI10.1090/mcom/3644zbMath1505.65165arXiv2007.02910OpenAlexW3131206285MaRDI QIDQ4956926
Publication date: 2 September 2021
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.02910
ARTKaczmarz methodsingular vectorprojection onto convex setsrandomized Kaczmarz methodalgebraic reconstruction techniquePOCS
Related Items (13)
On block accelerations of quantile randomized Kaczmarz for corrupted systems of linear equations ⋮ A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems ⋮ Approximate Solutions of Linear Systems at a Universal Rate ⋮ Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems ⋮ On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations ⋮ Randomized Block Adaptive Linear System Solvers ⋮ On convergence rates of Kaczmarz-type methods with different selection rules of working rows ⋮ Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency ⋮ Randomized Kaczmarz algorithm with averaging and block projection ⋮ On the regularization effect of stochastic gradient descent applied to least-squares ⋮ A weighted randomized sparse Kaczmarz method for solving linear systems ⋮ Greedy Kaczmarz Algorithm Using Optimal Intermediate Projection Technique for Coherent Linear Systems ⋮ Generalized Gearhart-Koshy acceleration for the Kaczmarz method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-subspace projection method for coherent overdetermined systems
- Randomized block Kaczmarz method with projection for solving least squares
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- The conjugate gradient regularization method in computed tomography problems
- The rate of convergence for the method of alternating projections. II
- On convergence rate of the randomized Kaczmarz method
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- A new greedy Kaczmarz algorithm for the solution of very large linear systems
- A derandomization approach to recovering bandlimited signals across a wide range of random sampling rates
- On Motzkin's method for inconsistent linear systems
- Convergence rates for Kaczmarz-type algorithms
- 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 Kaczmarz with averaging
- Randomized Extended Kaczmarz for Solving Least Squares
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- An accelerated randomized Kaczmarz algorithm
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- Randomized Iterative Methods for Linear Systems
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Semi-convergence properties of Kaczmarz’s method
- Randomized Kaczmarz Converges Along Small Singular Vectors
- On Adaptive Sketch-and-Project for Solving Linear Systems
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- A New Theoretical Estimate for the Convergence Rate of the Maximal Weighted Residual Kaczmarz Algorithm
- CoordinateWise Descent Methods for Leading Eigenvalue Problem
- Phase retrieval via randomized Kaczmarz: theoretical guarantees
- The Relaxation Method for Linear Inequalities
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
This page was built for publication: A weighted randomized Kaczmarz method for solving linear systems
