Randomized Kaczmarz Converges Along Small Singular Vectors
From MaRDI portal
(Redirected from Publication:4986830)
Cites work
- 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
- 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?)
- 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 block Kaczmarz method with projection for solving least squares
- Randomized extended Kaczmarz for solving least squares
- Randomized iterative methods for linear systems
- Randomized Kaczmarz solver for noisy 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
(27)- On the regularization effect of stochastic gradient descent applied to least-squares
- Developing Kaczmarz method for solving Sylvester matrix equations
- Eigenvector phase retrieval: recovering eigenvectors from the absolute value of their entries
- On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations
- Side effects of learning from low-dimensional data embedded in a Euclidean space
- A weighted randomized Kaczmarz method for solving linear systems
- 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
- Approximate Solutions of Linear Systems at a Universal Rate
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- Linearly convergent adjoint free solution of least squares problems by random descent
- The method of randomized Bregman projections for stochastic feasibility problems
- Randomized Kaczmarz algorithm with averaging and block projection
- Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition
- Randomized Kaczmarz converges along small singular vectors
- Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
- Randomized Kaczmarz with geometrically smoothed momentum
- On pseudoinverse-free randomized methods for linear systems: unified framework and acceleration
- A unified convergence analysis of random sketch methods for rank deficient linear systems
- A Kaczmarz-inspired method for orthogonalization
- Kaczmarz Kac walk
- On the triple-parameter least squares progressive iterative approximation and its convergence analysis
- The equivalence of the randomized extended Gauss-Seidel and randomized extended Kaczmarz methods
- On randomized explicit block Kaczmarz method for solving large linear systems
- On fast deterministic two-row block Kaczmarz method for solving consistent linear systems
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)
