On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems
From MaRDI portal
Publication:6086876
DOI10.1016/j.apnum.2023.06.008zbMath1526.65005MaRDI QIDQ6086876
No author found.
Publication date: 10 November 2023
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
inconsistencysystem of linear equationsmulti-step iterationconvergence propertyrandomized Kaczmarz method
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Cites Work
- Unnamed Item
- Unnamed Item
- Greedy and randomized versions of the multiplicative Schwarz method
- Randomized block Kaczmarz method with projection for solving least squares
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- 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
- A new greedy Kaczmarz algorithm for the solution of very large linear systems
- On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
- On convergence rate of the randomized Gauss-Seidel method
- Variant of greedy randomized Kaczmarz for ridge regression
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized Extended Kaczmarz for Solving Least Squares
- The university of Florida sparse matrix collection
- Optimal parameters in the HSS-like methods for saddle-point problems
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems
- On Relaxed Greedy Randomized Augmented Kaczmarz Methods for Solving Large Sparse Inconsistent Linear Systems
- Matrix Analysis and Computations
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
- On greedy randomized coordinate descent methods for solving large linear least‐squares problems
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- Preconditioned Iterative Methods for Weighted Toeplitz Least Squares Problems
- Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory
- On convergence rates of Kaczmarz-type methods with different selection rules of working rows
This page was built for publication: On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems