On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems

DOI10.1007/s11075-021-01104-xzbMath1480.65091OpenAlexW3163288653MaRDI QIDQ2066187

Wen-Ting Wu

Publication date: 13 January 2022

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-021-01104-x

zbMATH Keywords

linear least-squares problemKaczmarz methodconvergence propertyrandomized iterationtwo-subspace

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear equations (linear algebraic aspects) (15A06)

Related Items (14)

A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems ⋮ Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection ⋮ On greedy randomized average block Kaczmarz method for solving large linear systems ⋮ A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems ⋮ On Convergence of the Partially Randomized Extended Kaczmarz Method ⋮ Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems ⋮ Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems ⋮ Accelerated greedy randomized augmented Kaczmarz algorithm for inconsistent linear systems ⋮ On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems ⋮ On convergence rates of Kaczmarz-type methods with different selection rules of working rows ⋮ A surrogate hyperplane Kaczmarz method for solving consistent linear equations ⋮ Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems ⋮ Kaczmarz method with oblique projection ⋮ Greedy Kaczmarz Algorithm Using Optimal Intermediate Projection Technique for Coherent Linear Systems

Uses Software

• SparseMatrix
• AIR tools

Cites Work

• Two-subspace projection method for coherent overdetermined systems
• Randomized block Kaczmarz method with projection for solving least squares
• Randomized Kaczmarz solver for noisy linear systems
• A randomized Kaczmarz algorithm with exponential convergence
• On convergence rate of the randomized Kaczmarz method
• On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
• A new greedy Kaczmarz algorithm for the solution of very large linear systems
• On the Meany inequality with applications to convergence analysis of several row-action iteration methods
• On convergence rate of the randomized Gauss-Seidel method
• On the error estimate of the randomized double block Kaczmarz method
• On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
• AIR tools II: algebraic iterative reconstruction methods, improved implementation
• Paved with good intentions: analysis of a randomized block Kaczmarz method
• The Mathematics of Computerized Tomography
• Fundamentals of Computerized Tomography
• Randomized Extended Kaczmarz for Solving Least Squares
• The university of Florida sparse matrix collection
• Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
• Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
• Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
• On greedy randomized coordinate descent methods for solving large linear least‐squares problems
• Unnamed Item

This page was built for publication: On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems