A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems
From MaRDI portal
Publication:2127524
DOI10.3934/era.2022040zbMath1489.65091OpenAlexW4214576020MaRDI QIDQ2127524
Yimou Liao, Yin Feng, Tianxiu Lu
Publication date: 20 April 2022
Published in: Electronic Research Archive (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/era.2022040
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Two-subspace projection method for coherent overdetermined systems
- 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
- On two-subspace randomized extended Kaczmarz method for solving large 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
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Randomized Extended Kaczmarz for Solving Least Squares
- The university of Florida sparse matrix collection
- Iterative Methods for Solving Factorized Linear Systems
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- Randomized Iterative Methods for Linear Systems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Accuracy and Stability of Numerical 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
