Randomized Kaczmarz Converges Along Small Singular Vectors
From MaRDI portal
Publication:4986830
Cites work
- scientific article; zbMATH DE number 3856876 (Why is no real title available?)
- scientific article; zbMATH DE number 4001918 (Why is no real title available?)
- scientific article; zbMATH DE number 4021000 (Why is no real title available?)
- A randomized Kaczmarz algorithm with exponential convergence
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- An accelerated randomized Kaczmarz algorithm
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- On convergence rate of the randomized Kaczmarz method
- On the regularizing property of stochastic gradient descent
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Phase retrieval via randomized Kaczmarz: theoretical guarantees
- Preasymptotic convergence of randomized Kaczmarz method
- Randomized Kaczmarz solver for noisy linear systems
- Randomized block Kaczmarz method with projection for solving least squares
- Randomized extended Kaczmarz for solving least squares
- Randomized iterative methods for linear systems
- Randomized methods for linear constraints: convergence rates and conditioning
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- The conjugate gradient regularization method in computed tomography problems
Cited in
(19)- Developing Kaczmarz method for solving Sylvester matrix equations
- Randomized Kaczmarz with geometrically smoothed momentum
- Randomized Kaczmarz algorithm with averaging and block projection
- Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
- Randomized Kaczmarz converges along small singular vectors
- The method of randomized Bregman projections for stochastic feasibility problems
- A weighted randomized Kaczmarz method for solving linear systems
- Side effects of learning from low-dimensional data embedded in a Euclidean space
- On the regularization effect of stochastic gradient descent applied to least-squares
- On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations
- Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition
- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
- Linearly convergent adjoint free solution of least squares problems by random descent
- Surrounding the solution of a linear system of equations from all sides
- An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm
- A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- Approximate Solutions of Linear Systems at a Universal Rate
- Eigenvector phase retrieval: recovering eigenvectors from the absolute value of their entries
This page was built for publication: Randomized Kaczmarz Converges Along Small Singular Vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986830)