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 QIDQ2245100FDOQ2245100
Authors: Hanyu Li, Yanjun Zhang 
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
Recommendations
- The randomized Kaczmarz method with a new random selection rule
- A Randomized Solver for Linear Systems with Exponential Convergence
- A weighted randomized Kaczmarz method for solving linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- A new theoretical estimate for the convergence rate of the maximal weighted residual Kaczmarz algorithm
Cites Work
- The University of Florida sparse matrix collection
- A randomized Kaczmarz algorithm with exponential convergence
- Sample size selection in optimization methods for machine learning
- Faster least squares approximation
- Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation
- Randomized extended Kaczmarz for solving least squares
- 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
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Title not available (Why is that?)
- Near-optimal column-based matrix reconstruction
- Sketching as a tool for numerical linear algebra
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
- Variant of greedy randomized Kaczmarz for ridge regression
- A new theoretical estimate for the convergence rate of the maximal weighted residual Kaczmarz algorithm
- On the error estimate of the randomized double block Kaczmarz method
Cited In (8)
- Greedy randomized sampling nonlinear Kaczmarz methods
- A Count Sketch Kaczmarz Method For Solving Large Overdetermined Linear Systems
- A residual-based surrogate hyperplane extended Kaczmarz algorithm for large least squares problems
- On adaptive block coordinate descent methods for ridge regression
- A new theoretical estimate for the convergence rate of the maximal weighted residual Kaczmarz algorithm
- A surrogate hyperplane Kaczmarz method for solving consistent linear equations
- A randomized block extended Kaczmarz method with hybrid partitions for solving large inconsistent linear systems
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
Uses Software
This page was built for publication: A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2245100)
