Worth their weight: randomized and regularized block Kaczmarz algorithms without preprocessing

DOI10.1137/25M1764372MaRDI QIDQ7404672zbMATH OpenFDO

Authors Gil Goldshlager, Jiang Hu, Lin Lin

Publication date 2026

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/25M1764372

zbMATH Keywords

inconsistent problemslinear least-squaresnatural gradient descentrandomized Kaczmarzregularizationuniform sampling

Mathematics Subject Classification ID

Linear equations (linear algebraic aspects) (15A06) Iterative numerical methods for linear systems (65F10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites work

• A Kaczmarz-inspired approach to accelerate the optimization of neural network wavefunctions
• A randomized Kaczmarz algorithm with exponential convergence
• Block-iterative methods for consistent and inconsistent linear equations
• Fine-grained analysis and faster algorithms for iteratively solving linear systems
• scientific article; zbMATH DE number 7306852 (Why is no real title available?)
• Incremental proximal methods for large scale convex optimization
• Modified iterated Tikhonov methods for solving systems of nonlinear ill-posed equations
• Neural Galerkin schemes with active learning for high-dimensional evolution equations
• New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
• On block Gaussian sketching for the Kaczmarz method
• On greedy randomized block Kaczmarz method for consistent linear systems
• Parallelizing stochastic gradient descent for least squares regression: mini-batching, averaging, and model misspecification
• Paved with good intentions: analysis of a randomized block Kaczmarz method
• Randomized extended Kaczmarz for solving least squares
• Randomized iterative methods for linear systems
• Randomized Kaczmarz methods with beyond-Krylov convergence
• Randomized Kaczmarz solver for noisy linear systems
• Randomized Kaczmarz with tail averaging
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Sampled limited memory methods for massive linear inverse problems
• Semi-Infinite Linear Regression and Its Applications
• Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition
• Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
• Stochastic model-based minimization of weakly convex functions
• When and why PINNs fail to train: a neural tangent kernel perspective

This page was built for publication: Worth their weight: randomized and regularized block Kaczmarz algorithms without preprocessing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7404672)