Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces

DOI10.1016/j.acha.2022.07.005zbMath1497.65090OpenAlexW4288045268MaRDI QIDQ2168686

Xin Guo, Ding-Xuan Zhou, Jun Hong Lin

Publication date: 26 August 2022

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2022.07.005

zbMATH Keywords

weak convergenceHilbert spacerelaxation methodrandomized Kaczmarz algorithmonline gradient descent learning algorithm

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05)

Related Items (2)

Capacity dependent analysis for functional online learning algorithms ⋮ Online regularized learning algorithm for functional data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonparametric stochastic approximation with large step-sizes
• Introduction to the peptide binding problem of computational immunology: new results
• Schwarz iterative methods: infinite space splittings
• Learning gradients via an early stopping gradient descent method
• Optimal rates for regularization of statistical inverse learning problems
• Hilbertian convex feasibility problem: Convergence of projection methods
• Randomized Kaczmarz solver for noisy linear systems
• A randomized Kaczmarz algorithm with exponential convergence
• Online gradient descent learning algorithms
• Stochastic subspace correction in Hilbert space
• Linear convergence of the randomized sparse Kaczmarz method
• Über monotone Matrixfunktionen
• Almost sure convergence of the Kaczmarz algorithm with random measurements
• Modeling interactive components by coordinate kernel polynomial models
• Universality of deep convolutional neural networks
• Fast and strong convergence of online learning algorithms
• Convergence analysis for Kaczmarz-type methods in a Hilbert space framework
• Online learning algorithms
• On the factorization of matrices
• Fundamentals of Computerized Tomography
• An accelerated randomized Kaczmarz algorithm
• Randomized Iterative Methods for Linear Systems
• Iterated Products of Projections in Hilbert Space
• Online Regularized Classification Algorithms
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Deep distributed convolutional neural networks: Universality
• On Projection Algorithms for Solving Convex Feasibility Problems
• Functional Analysis
• Stability and optimization error of stochastic gradient descent for pairwise learning
• On Complexity Issues of Online Learning Algorithms
• Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems
• Online minimum error entropy algorithm with unbounded sampling
• The square root of a positive self-adjoint operator
• Shorter Notes: Some Operator Monotone Functions
• Best approximation in inner product spaces
• Randomized subspace actions and fusion frames

This page was built for publication: Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces