On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems
From MaRDI portal
Publication:2041935
DOI10.1007/s10092-021-00404-xzbMath1472.65040OpenAlexW3138686732WikidataQ114228538 ScholiaQ114228538MaRDI QIDQ2041935
Yong Liu, Xiang-Long Jiang, Chuanqing Gu
Publication date: 26 July 2021
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-021-00404-x
image reconstructionblock Gauss-Seidel algorithmleast-squares problemsmaximum residual block Gauss-Seidel algorithm
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Related Items
A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems, A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems, A class of residual-based extended Kaczmarz methods for solving inconsistent linear systems, An almost-maximal residual tensor block Kaczmarz method for large tensor linear systems, Accelerated greedy randomized augmented Kaczmarz algorithm for inconsistent linear systems, On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-subspace projection method for coherent overdetermined systems
- Randomized block Kaczmarz method with projection for solving least squares
- Block-iterative methods for consistent and inconsistent linear equations
- 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
- On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
- On block Gaussian sketching for the Kaczmarz method
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Randomized Kaczmarz with averaging
- Randomized Extended Kaczmarz for Solving Least Squares
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- The university of Florida sparse matrix collection
- Iterative Methods for Solving Factorized Linear Systems
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization
- Faster Randomized Block Kaczmarz Algorithms
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
- On greedy randomized coordinate descent methods for solving large linear least‐squares problems
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
- Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression
- The random paving property for uniformly bounded matrices
