Block sampling Kaczmarz-Motzkin methods for consistent linear systems
DOI10.1007/S10092-021-00429-2OpenAlexW3195878894MaRDI QIDQ2230558FDOQ2230558
Authors: Hanyu Li, Yanjun Zhang 
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)
Cites Work
- The University of Florida sparse matrix collection
- A randomized Kaczmarz algorithm with exponential convergence
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Title not available (Why is that?)
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized iterative methods for linear systems
- Randomized extended Kaczmarz for solving least squares
- Single projection Kaczmarz extended algorithms
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Randomized Kaczmarz solver for noisy linear systems
- Projected randomized Kaczmarz methods
- Randomized block Kaczmarz method with projection for solving least squares
- Randomized extended average block Kaczmarz for solving least squares
- Randomized Kaczmarz with averaging
- On Motzkin's method for inconsistent linear systems
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- Stochastic reformulations of linear systems: algorithms and convergence theory
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- Faster randomized block Kaczmarz algorithms
- On Adaptive Sketch-and-Project for Solving Linear Systems
- On the error estimate of the randomized double block Kaczmarz method
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
Cited In (12)
- Greedy randomized sampling nonlinear Kaczmarz methods
- On multi-step extended maximum residual Kaczmarz method for solving large inconsistent linear systems
- On maximum residual nonlinear Kaczmarz-type algorithms for large nonlinear systems of equations
- On pseudoinverse-free block maximum residual nonlinear Kaczmarz method for solving large-scale nonlinear system of equations
- Block sampling Kaczmarz-Motzkin methods for consistent linear systems
- A quantile-based block Kaczmarz algorithm for solving large consistent linear systems
- Efficient randomized block Kaczmarz method for linear feasibility
- On sampling Kaczmarz-Motzkin methods for solving large-scale nonlinear systems
- Splitting-based randomized iterative methods for solving indefinite least squares problem
- Randomized block subsampling Kaczmarz-Motzkin method
- Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
Uses Software
This page was built for publication: Block sampling Kaczmarz-Motzkin methods for consistent linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230558)
