Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems
From MaRDI portal
Publication:6139025
DOI10.4208/eajam.2022-203.140123zbMath1527.65022OpenAlexW4382199496MaRDI QIDQ6139025
Publication date: 18 December 2023
Published in: Unnamed Author (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4208/eajam.2022-203.140123
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
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- On greedy randomized average block Kaczmarz method for solving large linear systems
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- On block Gaussian sketching for the Kaczmarz method
- On convergence rate of the randomized Gauss-Seidel method
- Block sampling Kaczmarz-Motzkin methods for consistent linear systems
- A doubly stochastic block Gauss-Seidel algorithm for solving linear equations
- 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
- On greedy randomized block Kaczmarz method for consistent linear systems
- Randomized Kaczmarz with averaging
- 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
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems
- Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory
- Randomized Extended Average Block Kaczmarz for Solving Least Squares
- Faster Randomized Block Kaczmarz Algorithms
- A New Theoretical Estimate for the Convergence Rate of the Maximal Weighted Residual Kaczmarz Algorithm
- On greedy randomized coordinate descent methods for solving large linear least‐squares problems
- Some methods of speeding up the convergence of iteration methods
This page was built for publication: Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems