A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems

DOI10.4208/eajam.160721.160122zbMath1481.65050OpenAlexW4213311150MaRDI QIDQ5061750

Publication date: 14 March 2022

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/eajam.160721.160122

zbMATH Keywords

convergence linear least-squares problem Kaczmarz method coordinate descent method greedy blocks

Mathematics Subject Classification ID

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 (1)

On adaptive block coordinate descent methods for ridge regression

Uses Software

SparseMatrix

Cites Work

Unnamed Item
Randomized block Kaczmarz method with projection for solving least squares
On the complexity analysis of randomized block-coordinate descent methods
On the relation between the randomized extended Kaczmarz algorithm and coordinate descent
Randomized Kaczmarz solver for noisy linear systems
A randomized Kaczmarz algorithm with exponential convergence
On the convergence of the coordinate descent method for convex differentiable minimization
On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
On the Meany inequality with applications to convergence analysis of several row-action iteration methods
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 a fast deterministic block Kaczmarz method for solving large-scale linear systems
On convergence rate of the randomized Gauss-Seidel method
On the error estimate of the randomized double block Kaczmarz method
On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
Coordinate descent algorithms
Random block coordinate descent methods for linearly constrained optimization over networks
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Randomized Extended Kaczmarz for Solving Least Squares
The university of Florida sparse matrix collection
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems
Randomized Extended Average Block Kaczmarz for Solving Least Squares
On greedy randomized coordinate descent methods for solving large linear least‐squares problems

This page was built for publication: A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems