On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
Author:
- 12 May 2021
- journal article
- research article
- Published by Springer Nature in Numerical Algorithms
- Vol. 89 (1) , 1-31
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (No. 12001043)
- National Natural Science Foundation of China (No. 12071472)
- Beijing Institute of Technology Research Fund Program for Young Scholars
- Science and Technology Commission of Shanghai Municipality (No. 18dz2271000)
This publication has 24 references indexed in Scilit:
- Randomized block Kaczmarz method with projection for solving least squaresLinear Algebra and its Applications, 2015
- Paved with good intentions: Analysis of a randomized block Kaczmarz methodLinear Algebra and its Applications, 2014
- Two-Subspace Projection Method for Coherent Overdetermined SystemsJournal of Fourier Analysis and Applications, 2012
- On the Meany inequality with applications to convergence analysis of several row-action iteration methodsNumerische Mathematik, 2012
- Randomized Methods for Linear Constraints: Convergence Rates and ConditioningMathematics of Operations Research, 2010
- Randomized Kaczmarz solver for noisy linear systemsBIT Numerical Mathematics, 2010
- A Randomized Kaczmarz Algorithm with Exponential ConvergenceJournal of Fourier Analysis and Applications, 2008
- A unified treatment of some iterative algorithms in signal processing and image reconstructionInverse Problems, 2003
- The Mathematics of Computerized TomographyMedical Physics, 2002
- Row-Action Methods for Huge and Sparse Systems and Their ApplicationsSIAM Review, 1981