The greedy randomized extended Kaczmarz algorithm for noisy linear systems

DOI10.11948/20220230MaRDI QIDQ6612425zbMATH OpenFDO

Authors Na Chen, Deliang Zhu

Publication date 30 September 2024

Published in Journal of Applied Analysis and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.11948/20220230

zbMATH Keywords

convergence rategreedy criterionKaczmarz algorithmrandomized orthogonal projection

Mathematics Subject Classification ID

Inverse problems in optimal control (49N45) Randomized algorithms (68W20)

Cites work

• A new greedy Kaczmarz algorithm for the solution of very large linear systems
• A randomized Kaczmarz algorithm with exponential convergence
• Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
• scientific article; zbMATH DE number 3027894 (Why is no real title available?)
• Learning theory of randomized Kaczmarz algorithm
• Learning theory of randomized sparse Kaczmarz method
• Linear convergence of the randomized sparse Kaczmarz method
• Nonlinear Kaczmarz algorithms and their convergence
• On block Gaussian sketching for the Kaczmarz method
• On convergence rate of the randomized Kaczmarz method
• On greedy randomized Kaczmarz method for solving large sparse linear systems
• On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
• Randomized extended Kaczmarz for solving least squares
• Randomized Kaczmarz solver for noisy linear systems
• Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm

Cited in

(2)

• On greedy partially randomized extended Kaczmarz method for solving large sparse inconsistent linear systems
• Relaxed greedy randomized Kaczmarz with signal averaging for solving doubly-noisy linear systems

This page was built for publication: The greedy randomized extended Kaczmarz algorithm for noisy linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612425)