On a fast deterministic block Kaczmarz method for solving large-scale linear systems
From MaRDI portal
Publication:2116037
DOI10.1007/s11075-021-01143-4zbMath1487.65035OpenAlexW3173974481MaRDI QIDQ2116037
Publication date: 16 March 2022
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-021-01143-4
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Related Items
A Deterministic Kaczmarz Algorithm for Solving Linear Systems ⋮ A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems ⋮ On the relaxed greedy deterministic row and column iterative methods ⋮ On adaptive block coordinate descent methods for ridge regression ⋮ On convergence rates of Kaczmarz-type methods with different selection rules of working rows ⋮ A surrogate hyperplane Kaczmarz method for solving consistent linear equations ⋮ Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems ⋮ On pseudoinverse-free block maximum residual nonlinear Kaczmarz method for solving large-scale nonlinear system of equations ⋮ Randomized Kaczmarz algorithm with averaging and block projection ⋮ On fast greedy block Kaczmarz methods for solving large consistent linear systems ⋮ Randomized block subsampling Kaczmarz-Motzkin method
Uses Software
Cites Work
- Randomized block Kaczmarz method with projection for solving least squares
- Block-iterative methods for consistent and inconsistent linear equations
- 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
- Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
- 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
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Extrapolation algorithm for affine-convex feasibility problems
- 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
- Randomized Iterative Methods for Linear Systems
- Decomposition through formalization in a product space
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Randomized Extended Average Block Kaczmarz for Solving Least Squares
- Faster Randomized Block Kaczmarz Algorithms
- On a relaxation method of solving systems of linear inequalities
