A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems
From MaRDI portal
Publication:2245100
DOI10.1016/j.amc.2021.126486OpenAlexW3180038902MaRDI QIDQ2245100
Publication date: 12 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.02480
Related Items (3)
On adaptive block coordinate descent methods for ridge regression ⋮ A surrogate hyperplane Kaczmarz method for solving consistent linear equations ⋮ Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
Uses Software
Cites Work
- Unnamed Item
- Faster least squares approximation
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Sample size selection in optimization methods for machine learning
- 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
- On the error estimate of the randomized double block Kaczmarz method
- Projected randomized Kaczmarz methods
- Variant of greedy randomized Kaczmarz for ridge regression
- Randomized Extended Kaczmarz for Solving Least Squares
- Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation
- Computational Advertising: Techniques for Targeting Relevant Ads
- The university of Florida sparse matrix collection
- Low-Rank Approximation and Regression in Input Sparsity Time
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- 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
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
- Near-Optimal Column-Based Matrix Reconstruction
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
This page was built for publication: A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems
