Preasymptotic convergence of randomized Kaczmarz method
From MaRDI portal
Publication:4601433
DOI10.1088/1361-6420/aa8e82zbMath1382.65087arXiv1706.08459OpenAlexW3100274236MaRDI QIDQ4601433
Bangti Jin, Xiliang Lu, Yu Ling Jiao
Publication date: 16 January 2018
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.08459
Related Items (19)
A Deterministic Kaczmarz Algorithm for Solving Linear Systems ⋮ Approximate Solutions of Linear Systems at a Universal Rate ⋮ Stochastic mirror descent method for linear ill-posed problems in Banach spaces ⋮ Faster randomized block sparse Kaczmarz by averaging ⋮ Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency ⋮ Linearly convergent adjoint free solution of least squares problems by random descent ⋮ On the Convergence of Stochastic Gradient Descent for Nonlinear Ill-Posed Problems ⋮ The extensions of convergence rates of Kaczmarz-type methods ⋮ Splitting-based randomized iterative methods for solving indefinite least squares problem ⋮ Randomized block subsampling Kaczmarz-Motzkin method ⋮ On the regularizing property of stochastic gradient descent ⋮ Convergence rates of the Kaczmarz-Tanabe method for linear systems ⋮ Convergence analyses based on frequency decomposition for the randomized row iterative method ⋮ Projected randomized Kaczmarz methods ⋮ On the regularization effect of stochastic gradient descent applied to least-squares ⋮ On the generally randomized extended Gauss-Seidel method ⋮ Randomized Kaczmarz Converges Along Small Singular Vectors ⋮ Surrounding the solution of a linear system of equations from all sides ⋮ Sampled limited memory methods for massive linear inverse problems
This page was built for publication: Preasymptotic convergence of randomized Kaczmarz method
