Maximal residual extended Kaczmarz and Gauss-Seidel methods-convergence properties and applications

DOI10.1016/J.CAM.2024.115920MaRDI QIDQ6569156zbMATH OpenFDO

Authors Ashif Mustafa, Manideepa Saha

Publication date 8 July 2024

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.2024.115920

zbMATH Keywords

coordinate descentleast squares problemmaximal residual Kaczmarz methodpseudo-inverse solutionrandomized Gauss-Seidel methodrandomized Kaczmarz algorithm

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Iterative numerical methods for linear systems (65F10)

Recommendations

• A class of residual-based extended Kaczmarz methods for solving inconsistent linear systems
• Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection
• On greedy randomized Kaczmarz method for solving large sparse linear systems
• Greedy block extended Kaczmarz method for solving the least squares problems
• A new theoretical estimate for the convergence rate of the maximal weighted residual Kaczmarz algorithm

Cites work

• A New Class of Incremental Gradient Methods for Least Squares Problems
• A randomized Kaczmarz algorithm with exponential convergence
• Angenäherte Auflösung von Systemen linearer Gleichungen.
• Approximate solution of systems of linear equations†
• Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
• Convergence rates for Kaczmarz-type algorithms
• Correction to: ``Convergence rates for Kaczmarz-type algorithms
• Fundamentals of Computerized Tomography
• On convergence rates of Kaczmarz-type methods with different selection rules of working rows
• On extended Kaczmarz methods with random sampling and maximum-distance for solving large inconsistent linear systems
• On greedy randomized augmented Kaczmarz method for solving large sparse inconsistent linear systems
• On greedy randomized coordinate descent methods for solving large linear least-squares problems.
• On greedy randomized Kaczmarz method for solving large sparse linear systems
• On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
• Randomized extended Kaczmarz for solving least squares
• Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory
• Randomized Kaczmarz solver for noisy linear systems
• Randomized methods for linear constraints: convergence rates and conditioning
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Single projection Kaczmarz extended algorithms
• Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss-Seidel algorithms.

Cited in

(3)

• Greedy randomized sampling nonlinear Kaczmarz methods
• Greedy block extended Kaczmarz method for solving the least squares problems
• A maximal residual two subspace projection algorithm for solving least-squares problems

This page was built for publication: Maximal residual extended Kaczmarz and Gauss-Seidel methods-convergence properties and applications

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