Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems
From MaRDI portal
Publication:2667110
DOI10.1016/j.cam.2021.113828zbMath1490.65050OpenAlexW3199625109MaRDI QIDQ2667110
Publication date: 24 November 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2021.113828
Related Items (max. 100)
On global randomized block Kaczmarz method for image reconstruction ⋮ Restarted randomized surrounding methods for solving large linear equations ⋮ On randomized partial block Kaczmarz method for solving huge linear algebraic systems ⋮ On adaptive block coordinate descent methods for ridge regression ⋮ A surrogate hyperplane Kaczmarz method for solving consistent linear equations ⋮ On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems ⋮ Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- Distributed estimation via iterative projections with application to power network monitoring
- Projection methods for linear systems
- Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of 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
- An iterative procedure for the solution of constrained nonlinear equations with application to optimization 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
- A refinement of an iterative orthogonal projection method
- On the error estimate of the randomized double block Kaczmarz method
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Fundamentals of Computerized Tomography
- Randomized Extended Kaczmarz for Solving Least Squares
- The university of Florida sparse matrix collection
- 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
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- On the Numerical Behavior of Matrix Splitting Iteration Methods for Solving Linear Systems
This page was built for publication: Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems
