The equivalence of the randomized extended Gauss–Seidel and randomized extended Kaczmarz methods
- 20 March 2025
- journal article
- research article
- Published by Springer Nature in Calcolo
- Vol. 62 (2) , 1-24
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (12001043, 12401494)
- Beijing Institute of Technology Research Fund Program for Young Scholars
This publication has 32 references indexed in Scilit:
- A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systemsAdvances in Computational Mathematics, 2023
- Stochastic Gradient Descent with Polyak’s Learning RateJournal of Scientific Computing, 2021
- On a fast deterministic block Kaczmarz method for solving large-scale linear systemsNumerical Algorithms, 2021
- On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problemsApplied Numerical Mathematics, 2020
- On greedy randomized coordinate descent methods for solving large linear least‐squares problemsNumerical Linear Algebra with Applications, 2019
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systemsApplied Mathematics Letters, 2018
- On the relation between the randomized extended Kaczmarz algorithm and coordinate descentBIT Numerical Mathematics, 2014
- Fundamentals of Computerized Tomography2009
- A Randomized Kaczmarz Algorithm with Exponential ConvergenceJournal of Fourier Analysis and Applications, 2008
- Some methods of speeding up the convergence of iteration methodsUSSR Computational Mathematics and Mathematical Physics, 1964