A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems
From MaRDI portal
Publication:6042632
Recommendations
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
- The randomized Kaczmarz method with a new random selection rule
- A geometric probability randomized Kaczmarz method for large scale linear systems
- Faster randomized block Kaczmarz algorithms
- On greedy randomized Kaczmarz method for solving large sparse linear systems
Cites work
- A geometric probability randomized Kaczmarz method for large scale linear systems
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- A new greedy Kaczmarz algorithm for the solution of very large linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- A stochastic Kaczmarz algorithm for network tomography
- A twin error gauge for Kaczmarz's iterations
- A weighted randomized Kaczmarz method for solving linear systems
- An accelerated randomized Kaczmarz algorithm
- An efficient solution to the atmospheric turbulence tomography problem using Kaczmarz iteration
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Faster randomized block Kaczmarz algorithms
- Greedy Motzkin–Kaczmarz methods for solving linear systems
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
- Learning theory of randomized sparse Kaczmarz method
- On convergence rate of the randomized Kaczmarz method
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On greedy randomized augmented Kaczmarz method for solving large sparse inconsistent linear systems
- On greedy randomized coordinate descent methods for solving large linear least-squares problems.
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- On relaxed greedy randomized augmented Kaczmarz methods for solving large sparse inconsistent linear systems
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized Kaczmarz Converges Along Small Singular Vectors
- Randomized block Kaczmarz method with projection for solving least squares
- Randomized extended Kaczmarz for solving least squares
- Randomized extended average block Kaczmarz for solving least squares
- Randomized iterative methods for linear systems
- Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss-Seidel algorithms.
- Variant of greedy randomized Kaczmarz for ridge regression
Cited in
(5)- A geometric probability randomized Kaczmarz method for large scale linear systems
- A quantile-based block Kaczmarz algorithm for solving large consistent linear systems
- On sampling Kaczmarz-Motzkin methods for solving large-scale nonlinear systems
- On randomized sampling Kaczmarz method with application in compressed sensing
- A randomized block extended Kaczmarz method with hybrid partitions for solving large inconsistent linear systems
This page was built for publication: A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042632)