The Kaczmarz algorithm, row action methods, and statistical learning algorithms
From MaRDI portal
Publication:4686248
DOI10.1090/conm/706/14216zbMath1401.65032OpenAlexW2802315361MaRDI QIDQ4686248
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
Learning and adaptive systems in artificial intelligence (68T05) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Iterative numerical methods for linear systems (65F10)
Related Items (3)
Accelerating the distributed Kaczmarz algorithm by strong over-relaxation ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- On the convergence properties of Hildreth's quadratic programming algorithm
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- Convergence analysis for Kaczmarz-type methods in a Hilbert space framework
- Hildreth's algorithm with applications to soft constraints for user interface layout
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Projection method for solving a singular system of linear equations and its applications
- Fundamentals of Computerized Tomography
- Randomized Extended Kaczmarz for Solving Least Squares
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Convergence of the cyclical relaxation method for linear inequalities
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study
- The Relaxation Method for Solving Systems of Linear Inequalities
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- A New Class of Incremental Gradient Methods for Least Squares Problems
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Approximate solution of systems of linear equations†
- 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
- Randomized subspace actions and fusion frames
This page was built for publication: The Kaczmarz algorithm, row action methods, and statistical learning algorithms
