Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
From MaRDI portal
Publication:4999361
DOI10.1137/19M1307044MaRDI QIDQ4999361
Publication date: 6 July 2021
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.03544
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Related Items (18)
On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation \(A X B = C\) ⋮ On block accelerations of quantile randomized Kaczmarz for corrupted systems of linear equations ⋮ Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration ⋮ Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations ⋮ Adaptively sketched Bregman projection methods for linear systems ⋮ RidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge Regression ⋮ Approximate Solutions of Linear Systems at a Universal Rate ⋮ On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations ⋮ On convergence rates of Kaczmarz-type methods with different selection rules of working rows ⋮ Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition ⋮ Splitting-based randomized iterative methods for solving indefinite least squares problem ⋮ Randomized block subsampling Kaczmarz-Motzkin method ⋮ Block sampling Kaczmarz-Motzkin methods for consistent linear systems ⋮ A weighted randomized Kaczmarz method for solving linear systems ⋮ On Adaptive Sketch-and-Project for Solving Linear Systems ⋮ Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems ⋮ Greedy Kaczmarz Algorithm Using Optimal Intermediate Projection Technique for Coherent Linear Systems ⋮ Generalized Gearhart-Koshy acceleration for the Kaczmarz method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- On Kaczmarz's projection iteration as a direct solver for linear least squares problems
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
- On the acceleration of Kaczmarz's method for inconsistent linear systems
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- On relaxation methods for systems of linear inequalities
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- Projection algorithms for linear programming
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- On Motzkin's method for inconsistent linear systems
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
- On block Gaussian sketching for the Kaczmarz method
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Fast linear iterations for distributed averaging
- Randomized Extended Kaczmarz for Solving Least Squares
- The university of Florida sparse matrix collection
- Statistical mechanics of complex networks
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- Randomized Iterative Methods for Linear Systems
- The Relaxation Method for Solving Systems of Linear Inequalities
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- On the non-polynomiality of the relaxation method for systems of linear inequalities
- Greedy Gossip With Eavesdropping
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- A New Theoretical Estimate for the Convergence Rate of the Maximal Weighted Residual Kaczmarz Algorithm
- Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility
- Boundedness Theorems for the Relaxation Method
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Convergence Analysis of Inexact Randomized Iterative Methods
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
This page was built for publication: Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
