On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems

DOI10.1016/J.APNUM.2020.06.014zbMath1452.65074OpenAlexW3039193804WikidataQ112880240 ScholiaQ112880240MaRDI QIDQ2192631

Jinghui Guo, Zhang, Jianhua

Publication date: 17 August 2020

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2020.06.014

zbMATH Keywords

linear least-squares problemrelaxation techniquegreedy randomized coordinate descent

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (10)

A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems ⋮ Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection ⋮ On the relaxed greedy deterministic row and column iterative methods ⋮ On adaptive block coordinate descent methods for ridge regression ⋮ On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems ⋮ On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems ⋮ On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems ⋮ Randomized double and triple Kaczmarz for solving extended normal equations ⋮ On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem ⋮ Gauss-Seidel method with oblique direction

Uses Software

• SparseMatrix

Cites Work

• Unnamed Item
• On the complexity analysis of randomized block-coordinate descent methods
• A randomized Kaczmarz algorithm with exponential convergence
• On convergence rate of the randomized Kaczmarz method
• 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
• Variant of greedy randomized Kaczmarz for ridge regression
• On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
• Random block coordinate descent methods for linearly constrained optimization over networks
• Randomized Extended Kaczmarz for Solving Least Squares
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• 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
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
• A New Theoretical Estimate for the Convergence Rate of the Maximal Weighted Residual Kaczmarz Algorithm
• 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

This page was built for publication: On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems