A geometric probability randomized Kaczmarz method for large scale linear systems
From MaRDI portal
Publication:1995943
DOI10.1016/j.apnum.2020.10.016zbMath1460.65036OpenAlexW3093588021MaRDI QIDQ1995943
Publication date: 2 March 2021
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2020.10.016
computational complexitylinear systemconvergence propertyrandomized methodsupervised probability criterion
Related Items
Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection, A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems, On adaptive block coordinate descent methods for ridge regression, On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations, A surrogate hyperplane Kaczmarz method for solving consistent linear equations, Gauss-Seidel method with oblique direction, Greedy Kaczmarz Algorithm Using Optimal Intermediate Projection Technique for Coherent Linear Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel coordinate descent methods for big data optimization
- Distributed estimation via iterative projections with application to power network monitoring
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- GPU computing with Kaczmarz's and other iterative algorithms for linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
- On convergence rate of the randomized Kaczmarz method
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Coordinate descent algorithms
- Fundamentals of Computerized Tomography
- Randomized Extended Kaczmarz for Solving Least Squares
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Multicore Performance of Block Algebraic Iterative Reconstruction Methods
- The university of Florida sparse matrix collection
- Randomized Algorithms for Matrices and Data
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- An accelerated randomized Kaczmarz algorithm
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- On greedy randomized coordinate descent methods for solving large linear least‐squares problems
