Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
From MaRDI portal
(Redirected from Publication:2168686)
Recommendations
Cites work
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 193012 (Why is no real title available?)
- scientific article; zbMATH DE number 2111135 (Why is no real title available?)
- scientific article; zbMATH DE number 3230744 (Why is no real title available?)
- A randomized Kaczmarz algorithm with exponential convergence
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- Alternating projection methods.
- An accelerated randomized Kaczmarz algorithm
- Best approximation in inner product spaces
- Convergence analysis for Kaczmarz-type methods in a Hilbert space framework
- Deep distributed convolutional neural networks: universality
- Fast and strong convergence of online learning algorithms
- Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems
- Functional Analysis
- Fundamentals of Computerized Tomography
- Hilbertian convex feasibility problem: Convergence of projection methods
- Introduction to the peptide binding problem of computational immunology: new results
- Iterated Products of Projections in Hilbert Space
- Learning gradients via an early stopping gradient descent method
- Learning theory of randomized Kaczmarz algorithm
- Linear convergence of the randomized sparse Kaczmarz method
- Modeling interactive components by coordinate kernel polynomial models
- Nonparametric stochastic approximation with large step-sizes
- On Complexity Issues of Online Learning Algorithms
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the factorization of matrices
- Online Regularized Classification Algorithms
- Online gradient descent learning algorithms
- Online learning algorithms
- Online minimum error entropy algorithm with unbounded sampling
- Optimal rates for regularization of statistical inverse learning problems
- Randomized Kaczmarz solver for noisy linear systems
- Randomized iterative methods for linear systems
- Randomized subspace actions and fusion frames
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Schwarz iterative methods: infinite space splittings
- Shorter Notes: Some Operator Monotone Functions
- Sparse online learning via truncated gradient
- Sparsity and error analysis of empirical feature-based regularization schemes
- Stability and optimization error of stochastic gradient descent for pairwise learning
- Stochastic subspace correction in Hilbert space
- The square root of a positive self-adjoint operator
- Universality of deep convolutional neural networks
- Über monotone Matrixfunktionen
Cited in
(15)- Learning theory of randomized sparse Kaczmarz method
- A projective double inertial forward-backward splitting algorithm for variational inclusion problems application to data classification
- Learning theory of randomized Kaczmarz algorithm
- On convergence rate of the randomized Kaczmarz method
- Convergence analysis of online algorithms for vector-valued kernel regression
- Kaczmarz algorithm with relaxation in Hilbert space
- Capacity dependent analysis for functional online learning algorithms
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
- Convergence analysis for Kaczmarz-type methods in a Hilbert space framework
- An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm
- Kaczmarz algorithm in Hilbert space
- Online regularized learning algorithm for functional data
- High probability bounds on AdaGrad for constrained weakly convex optimization
- A randomized Kaczmarz algorithm with exponential convergence
- Correction to: ``Convergence rates for Kaczmarz-type algorithms
This page was built for publication: Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168686)
