On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems
From MaRDI portal
Publication:5015300
DOI10.1137/20M1352235zbMath1483.65065MaRDI QIDQ5015300
Publication date: 7 December 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
inconsistencysystem of linear equationsKaczmarz methodconvergence propertyrandomized iterationaugmented linear system
Computational methods for sparse matrices (65F50) 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
On greedy randomized average block Kaczmarz method for solving large linear systems, On Relaxed Greedy Randomized Augmented Kaczmarz Methods for Solving Large Sparse Inconsistent Linear Systems, A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems, On Convergence of the Partially Randomized Extended Kaczmarz Method, On randomized partial block Kaczmarz method for solving huge linear algebraic systems, A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems, On adaptive block coordinate descent methods for ridge regression, Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory, 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, Accelerated greedy randomized augmented Kaczmarz algorithm for inconsistent linear systems, On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems, On convergence rates of Kaczmarz-type methods with different selection rules of working rows, Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems, Randomized Kaczmarz algorithm with averaging and block projection, Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems, A Partially Greedy Randomized Extended Gauss-Seidel Method for Solving Large Linear Systems
Uses Software
Cites Work
- Unnamed Item
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- 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 the Meany inequality with applications to convergence analysis of several row-action iteration methods
- 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
- The Mathematics of Computerized Tomography
- Fundamentals of Computerized Tomography
- Randomized Extended Kaczmarz for Solving Least Squares
- The university of Florida sparse matrix collection
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- Image reconstruction from a small number of projections
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- 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
