The Kaczmarz algorithm, row action methods, and statistical learning algorithms
DOI10.1090/CONM/706/14216zbMATH Open1401.65032OpenAlexW2802315361MaRDI QIDQ4686248FDOQ4686248
Authors: Xuemei Chen 
Publication date: 9 October 2018
Published in: Contemporary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/conm/706/14216
Recommendations
- Learning theory of randomized Kaczmarz algorithm
- Learning theory of randomized sparse Kaczmarz method
- The row-oriented form of the regularized Kaczmarz's method
- Random matrix methods for machine learning
- The Kernel Recursive Least-Squares Algorithm
- An accelerated randomized Kaczmarz algorithm
- scientific article; zbMATH DE number 7708789
- Kullback proximal algorithms for maximum-likelihood estimation
- scientific article; zbMATH DE number 1785983
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
Learning and adaptive systems in artificial intelligence (68T05) Iterative numerical methods for linear systems (65F10) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)
Cites Work
- A randomized Kaczmarz algorithm with exponential convergence
- Fundamentals of Computerized Tomography
- On Projection Algorithms for Solving Convex Feasibility Problems
- Title not available (Why is that?)
- Deep learning
- Title not available (Why is that?)
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Title not available (Why is that?)
- Randomized methods for linear constraints: convergence rates and conditioning
- Functional Operators (AM-22), Volume 2
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- A New Class of Incremental Gradient Methods for Least Squares Problems
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- Projection method for solving a singular system of linear equations and its applications
- Randomized extended Kaczmarz for solving least squares
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Randomized Kaczmarz solver for noisy linear systems
- The Relaxation Method for Solving Systems of Linear Inequalities
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- On the convergence properties of Hildreth's quadratic programming algorithm
- Convergence analysis for Kaczmarz-type methods in a Hilbert space framework
- Approximate solution of systems of linear equations†
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Randomized subspace actions and fusion frames
- Hildreth's algorithm with applications to soft constraints for user interface layout
- Convergence of the cyclical relaxation method for linear inequalities
- Learning theory of randomized Kaczmarz algorithm
- Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study
Cited In (6)
- Accelerating the distributed Kaczmarz algorithm by strong over-relaxation
- Selectable Set Randomized Kaczmarz
- A Kaczmarz algorithm for sequences of projections, infinite products, and applications to frames in IFS \(L^2\) spaces
- A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression
This page was built for publication: The Kaczmarz algorithm, row action methods, and statistical learning algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4686248)
