Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory
From MaRDI portal
Publication:6072364
DOI10.1007/s13160-023-00586-7zbMath1526.65006MaRDI QIDQ6072364
Publication date: 13 October 2023
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
system of linear equationsKaczmarz methodconvergence propertycoordinate descent methodrandomized projection iteration
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A randomized Kaczmarz algorithm with exponential convergence
- On convergence rate of the randomized Kaczmarz method
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- On convergence rate of the randomized Gauss-Seidel method
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Convergence rates for Kaczmarz-type algorithms
- 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
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems
- Computed Tomography: Algorithms, Insight, and Just Enough Theory
- On Relaxed Greedy Randomized Augmented Kaczmarz Methods for Solving Large Sparse Inconsistent Linear Systems
- On Convergence of the Partially Randomized Extended Kaczmarz Method
- Matrix Analysis and Computations
- On greedy randomized coordinate descent methods for solving large linear least‐squares problems
- A Matrix Inequality
- On convergence rates of Kaczmarz-type methods with different selection rules of working rows
This page was built for publication: Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory