Projected randomized Kaczmarz methods
From MaRDI portal
Publication:2297173
DOI10.1016/j.cam.2019.112672zbMath1433.65070OpenAlexW2996817875WikidataQ126412899 ScholiaQ126412899MaRDI QIDQ2297173
Publication date: 18 February 2020
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2019.112672
exponential convergencesemiconvergenceprojected algebra reconstruction techniqueprojected randomized iterative method
Factorization of matrices (15A23) Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)
Related Items
A Deterministic Kaczmarz Algorithm for Solving Linear Systems ⋮ Block sampling Kaczmarz-Motzkin methods for consistent linear systems ⋮ An extended row and column method for solving linear systems on a quantum computer ⋮ A doubly stochastic block Gauss-Seidel algorithm for solving linear equations ⋮ A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems ⋮ Convergence analyses based on frequency decomposition for the randomized row iterative method ⋮ Randomized double and triple Kaczmarz for solving extended normal equations ⋮ Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
- Semi-convergence and relaxation parameters for a class of SIRT algorithms
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Projected Landweber iteration for matrix completion
- Generalized row-action methods for tomographic imaging
- 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
- Three-person multi-objective conflict decision in reservoir flood control
- Convergence of projected Landweber iteration for matrix rank minimization
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- Fundamentals of Computerized Tomography
- Randomized Extended Kaczmarz for Solving Least Squares
- Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Randomized Iterative Methods for Linear Systems
- The Probability That a Numerical Analysis Problem is Difficult
- Row Projection Methods for Large Nonsymmetric Linear Systems
- Preasymptotic convergence of randomized Kaczmarz method
- Unmatched Projector/Backprojector Pairs: Perturbation and Convergence Analysis
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Computational Methods for Inverse Problems
- Least-squares solution of overdetermined inconsistent linear systems using kaczmarz's relaxation
- Semi-convergence properties of Kaczmarz’s method
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems