On convergence rate of the randomized Kaczmarz method
From MaRDI portal
Publication:1642017
DOI10.1016/j.laa.2018.05.009zbMath1391.65063OpenAlexW2801289644MaRDI QIDQ1642017
Publication date: 20 June 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2018.05.009
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 (38)
Convergence of a randomized Douglas-Rachford method for linear system ⋮ On greedy randomized average block Kaczmarz method for solving large linear systems ⋮ On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation \(A X B = C\) ⋮ On Relaxed Greedy Randomized Augmented Kaczmarz Methods for Solving Large Sparse Inconsistent Linear Systems ⋮ On Convergence of the Partially Randomized Extended Kaczmarz Method ⋮ Randomized Kaczmarz methods for tensor complementarity problems ⋮ A class of residual-based extended Kaczmarz methods for solving inconsistent linear systems ⋮ Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems ⋮ On extended Kaczmarz methods with random sampling and maximum-distance for solving large inconsistent linear systems ⋮ A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems ⋮ Approximate Solutions of Linear Systems at a Universal Rate ⋮ Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory ⋮ On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations ⋮ On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems ⋮ On convergence rates of Kaczmarz-type methods with different selection rules of working rows ⋮ On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems ⋮ Randomized Kaczmarz algorithm with averaging and block projection ⋮ A new greedy Kaczmarz algorithm for the solution of very large linear systems ⋮ On convergence rate of the randomized Gauss-Seidel method ⋮ Randomized Extended Average Block Kaczmarz for Solving Least Squares ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems ⋮ A doubly stochastic block Gauss-Seidel algorithm for solving linear equations ⋮ A geometric probability randomized Kaczmarz method for large scale linear systems ⋮ On the error estimate of the randomized double block Kaczmarz method ⋮ A weighted randomized Kaczmarz method for solving linear systems ⋮ Projected randomized Kaczmarz methods ⋮ On the regularization effect of stochastic gradient descent applied to least-squares ⋮ On the generally randomized extended Gauss-Seidel method ⋮ Variant of greedy randomized Kaczmarz for ridge regression ⋮ On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems ⋮ Randomized Kaczmarz Converges Along Small Singular Vectors ⋮ On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems ⋮ On relaxed greedy randomized iterative methods for the solution of factorized linear systems ⋮ Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems ⋮ Greedy Kaczmarz Algorithm Using Optimal Intermediate Projection Technique for Coherent Linear Systems ⋮ A Partially Greedy Randomized Extended Gauss-Seidel Method for Solving Large Linear Systems ⋮ On a fast deterministic block Kaczmarz method for solving large-scale linear systems
Uses Software
Cites Work
This page was built for publication: On convergence rate of the randomized Kaczmarz method
