On the relation between the randomized extended Kaczmarz algorithm and coordinate descent
From MaRDI portal
Publication:906948
DOI10.1007/s10543-014-0526-9zbMath1332.65056arXiv1405.6920OpenAlexW2056515450MaRDI QIDQ906948
Publication date: 1 February 2016
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.6920
Related Items (7)
Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods ⋮ A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems ⋮ Randomized Kaczmarz algorithm with averaging and block projection ⋮ Randomized Extended Average Block Kaczmarz for Solving Least Squares ⋮ On Adaptive Sketch-and-Project for Solving Linear Systems ⋮ On relaxed greedy randomized iterative methods for the solution of factorized linear systems ⋮ Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method
Cites Work
- On the acceleration of Kaczmarz's method for inconsistent linear systems
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Randomized Extended Kaczmarz for Solving Least Squares
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Least-squares solution of overdetermined inconsistent linear systems using kaczmarz's relaxation
This page was built for publication: On the relation between the randomized extended Kaczmarz algorithm and coordinate descent
