Enhancement of the Kaczmarz algorithm with projection adjustment
From MaRDI portal
Publication:2200803
DOI10.1007/s11075-019-00834-3zbMath1486.65037OpenAlexW2995888106WikidataQ126552694 ScholiaQ126552694MaRDI QIDQ2200803
Chuan Lin, Gabor T. Herman, Marcelo V. W. Zibetti
Publication date: 22 September 2020
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-019-00834-3
Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20) Linear equations (linear algebraic aspects) (15A06)
Cites Work
- Unnamed Item
- Unnamed Item
- Single projection Kaczmarz extended algorithms
- The convergence of the block cyclic projection with an overrelaxation parameter for compressed sensing based tomography
- Randomized block Kaczmarz method with projection for solving least squares
- Convergence acceleration of Kaczmarz's method
- A linear acceleration row action method for projecting onto subspaces
- A randomized Kaczmarz algorithm with exponential convergence
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
- A parallel subgradient projections method for the convex feasibility problem
- Acceleration schemes for the method of alternating projections
- A class of optimized row projection methods for solving large nonsymmetric linear systems
- Supplementary projections for the acceleration of Kaczmarz algorithm
- An acceleration scheme for cyclic subgradient projections method
- Convergence rates for Kaczmarz-type algorithms
- Projection method for solving a singular system of linear equations and its applications
- A hybrid Kaczmarz-conjugate gradient algorithm for image reconstruction
- Fundamentals of Computerized Tomography
- Randomized Extended Kaczmarz for Solving Least Squares
- Numerical Methods and Optimization
- Convergence of the simultaneous algebraic reconstruction technique (SART)
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- The Averaged Kaczmarz Iteration for Solving Inverse Problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility
- Numerical Linear Algebra
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
This page was built for publication: Enhancement of the Kaczmarz algorithm with projection adjustment