Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
From MaRDI portal
Publication:1387247
DOI10.1007/BF02510922zbMath1005.65038MaRDI QIDQ1387247
Publication date: 2 August 1998
Published in: BIT (Search for Journal in Brave)
numerical experimentsminimal norm solutionKaczmarz iterationblock-projection algorithmsinconsistent linear least-squares problems
Related Items (23)
A general extending and constraining procedure for linear iterative methods ⋮ Han-type algorithms for inconsistent systems of linear inequalities -- a unified approach ⋮ Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods ⋮ A hybrid Kaczmarz-conjugate gradient algorithm for image reconstruction ⋮ Supplementary projections for the acceleration of Kaczmarz algorithm ⋮ Single projection Kaczmarz extended algorithms ⋮ A class of residual-based extended Kaczmarz methods for solving inconsistent linear systems ⋮ On extended Kaczmarz methods with random sampling and maximum-distance for solving large inconsistent linear systems ⋮ Convergence rates for Kaczmarz-type algorithms ⋮ Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems ⋮ Accelerated greedy randomized augmented Kaczmarz algorithm for inconsistent linear systems ⋮ Paved with good intentions: analysis of a randomized block Kaczmarz method ⋮ On the Meany inequality with applications to convergence analysis of several row-action iteration methods ⋮ On Kaczmarz's projection iteration as a direct solver for linear least squares problems ⋮ Randomized Extended Average Block Kaczmarz for Solving Least Squares ⋮ Randomized block Kaczmarz method with projection for solving least squares ⋮ Incomplete oblique projections for solving large inconsistent linear systems ⋮ Constrained Kaczmarz extended algorithm for image reconstruction ⋮ Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm ⋮ On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems ⋮ On relaxed greedy randomized iterative methods for the solution of factorized linear systems ⋮ Sampled limited memory methods for massive linear inverse problems ⋮ On a fast deterministic block Kaczmarz method for solving large-scale linear systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Block-iterative methods for consistent and inconsistent linear equations
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- Algebraic multigrid theory: The symmetric case
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Projection method for solving a singular system of linear equations and its applications
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
- Least-squares solution of overdetermined inconsistent linear systems using kaczmarz's relaxation
This page was built for publication: Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
