A maximal residual two subspace projection algorithm for solving least-squares problems

DOI10.1007/S42967-025-00495-1MaRDI QIDQ7267832zbMATH OpenFDO

Authors Ashif Mustafa, Manideepa Saha

Publication date 16 June 2026

Published in Communications on Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S42967-025-00495-1

zbMATH Keywords

coordinate descentiterative techniquesleast-squares problemPetrov-Galerkin conditionprojection methodsrandomized methods

Mathematics Subject Classification ID

Linear equations (linear algebraic aspects) (15A06) Iterative numerical methods for linear systems (65F10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites work

• A generalized projection iterative methods for solving non-singular linear systems
• A new randomized Gauss-Seidel method for solving linear least-squares problems
• A randomized Kaczmarz algorithm with exponential convergence
• A two-dimensional randomized extended Gauss-Seidel algorithm for solving least squares problems
• A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems
• Approximate solution of systems of linear equations†
• Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
• Convergence rates for Kaczmarz-type algorithms
• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• scientific article; zbMATH DE number 3027894 (Why is no real title available?)
• Maximal residual extended Kaczmarz and Gauss-Seidel methods-convergence properties and applications
• 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 maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems
• On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems
• On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
• Randomized extended Kaczmarz for solving least squares
• Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory
• Randomized methods for linear constraints: convergence rates and conditioning
• Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss-Seidel algorithms.
• Two-subspace projection method for coherent overdetermined systems

This page was built for publication: A maximal residual two subspace projection algorithm for solving least-squares problems

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