On adaptive stochastic heavy ball momentum for solving linear systems
From MaRDI portal
Publication:6577448
DOI10.1137/23M1575883zbMATH Open1543.65041MaRDI QIDQ6577448
Yansheng Su, Yun Zeng, Deren Han, Jiaxin Xie
Publication date: 23 July 2024
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Convex programming (90C25) Iterative numerical methods for linear systems (65F10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-subspace projection method for coherent overdetermined systems
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
- Linear convergence of the randomized sparse Kaczmarz method
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
- An adaptive Polyak heavy-ball method
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Angenäherte Auflösung von Systemen linearer Gleichungen.
- Randomized Kaczmarz with averaging
- The mathematics of computerized tomography
- Randomized extended Kaczmarz for solving least squares
- Iterative methods for linear systems. Theory and applications
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- An accelerated randomized Kaczmarz algorithm
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- Randomized Iterative Methods for Linear Systems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- On Adaptive Sketch-and-Project for Solving Linear Systems
- On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems
- Revisiting Randomized Gossip Algorithms: General Framework, Convergence Rates and Novel Block and Accelerated Protocols
- Stochastic block projection algorithms with extrapolation for convex feasibility problems
- Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory
- Randomized Extended Average Block Kaczmarz for Solving Least Squares
- Faster Randomized Block Kaczmarz Algorithms
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
- Stochastic Gradient Descent for Linear Systems with Missing Data
- Some methods of speeding up the convergence of iteration methods
- Methods of conjugate gradients for solving linear systems
- A Stochastic Approximation Method
- Semiconvergence analysis of the randomized row iterative method and its extended variants
- Regularized Kaczmarz Algorithms for Tensor Recovery
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
This page was built for publication: On adaptive stochastic heavy ball momentum for solving linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6577448)