Block sampling Kaczmarz-Motzkin methods for consistent linear systems
From MaRDI portal
Publication:2230558
DOI10.1007/s10092-021-00429-2OpenAlexW3195878894MaRDI QIDQ2230558
Publication date: 24 September 2021
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.06688
greedy strategyconsistent linear systemsblock sampling Kaczmarz-Motzkin methodssampling Kaczmarz-Motzkin method
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Related Items (6)
On maximum residual nonlinear Kaczmarz-type algorithms for large nonlinear systems of 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 ⋮ Splitting-based randomized iterative methods for solving indefinite least squares problem ⋮ Randomized block subsampling Kaczmarz-Motzkin method ⋮ Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
Uses Software
Cites Work
- Unnamed Item
- Single projection Kaczmarz extended algorithms
- Randomized block Kaczmarz method with projection for solving least squares
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- On Motzkin's method for inconsistent linear systems
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- On the error estimate of the randomized double block Kaczmarz method
- Projected randomized Kaczmarz methods
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized Kaczmarz with averaging
- 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
- Randomized Iterative Methods for Linear Systems
- On Adaptive Sketch-and-Project for Solving Linear Systems
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory
- Randomized Extended Average Block Kaczmarz for Solving Least Squares
- Faster Randomized Block Kaczmarz Algorithms
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
This page was built for publication: Block sampling Kaczmarz-Motzkin methods for consistent linear systems
