On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems

DOI10.1007/s10092-023-00549-xzbMath1530.65036OpenAlexW4388623785MaRDI QIDQ6142558

Publication date: 4 January 2024

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10092-023-00549-x

zbMATH Keywords

image processing Gauss-Seidel method convergence property least-squares problems extrapolation stepsizes

Mathematics Subject Classification ID

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

Cites Work

Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
On the complexity analysis of randomized block-coordinate descent methods
A randomized Kaczmarz algorithm with exponential convergence
Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems
Tikhonov regularization with MTRSVD method for solving large-scale discrete ill-posed problems
A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems
On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
On convergence rate of the randomized Gauss-Seidel method
A doubly stochastic block Gauss-Seidel algorithm for solving linear equations
Variant of greedy randomized Kaczmarz for ridge regression
On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
AIR tools II: algebraic iterative reconstruction methods, improved implementation
Paved with good intentions: analysis of a randomized block Kaczmarz method
Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems
The university of Florida sparse matrix collection
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
A unified treatment of some iterative algorithms in signal processing and image reconstruction
Variant of Greedy Randomized Gauss-Seidel Method for Ridge Regression
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
Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression
Unnamed Item
Unnamed Item

This page was built for publication: On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems