On pseudoinverse-free randomized methods for linear systems: unified framework and acceleration
From MaRDI portal
Cites work
- A Deterministic Kaczmarz Algorithm for Solving Linear Systems
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A linearly convergent doubly stochastic Gauss-Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems
- A randomized Kaczmarz algorithm with exponential convergence
- A survey on some recent developments of alternating direction method of multipliers
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A weighted randomized Kaczmarz method for solving linear systems
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
- Adaptively sketched Bregman projection methods for linear systems
- An accelerated randomized Kaczmarz algorithm
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Angenäherte Auflösung von Systemen linearer Gleichungen.
- Convergence analyses based on frequency decomposition for the randomized row iterative method
- Coordinate descent method for large-scale L2-loss linear support vector machines
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Faster randomized block Kaczmarz algorithms
- First-order and stochastic optimization methods for machine learning
- Greedy and randomized versions of the multiplicative Schwarz method
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Iterative methods for linear systems. Theory and applications
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- New Douglas-Rachford algorithmic structures and their convergence analyses
- Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
- On Adaptive Sketch-and-Project for Solving Linear Systems
- On convergence rate of the randomized Kaczmarz method
- On greedy randomized augmented Kaczmarz method for solving large sparse inconsistent linear systems
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Preasymptotic convergence of randomized Kaczmarz method
- Random Geometric Graphs
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- Randomized extended average block Kaczmarz for solving least squares
- Randomized extended Kaczmarz for solving least squares
- Randomized iterative methods for linear systems
- Randomized Kaczmarz Converges Along Small Singular Vectors
- Randomized methods for linear constraints: convergence rates and conditioning
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- Regularized Kaczmarz Algorithms for Tensor Recovery
- Revisiting Randomized Gossip Algorithms: General Framework, Convergence Rates and Novel Block and Accelerated Protocols
- Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
- Some methods of speeding up the convergence of iteration methods
- Stochastic reformulations of linear systems: algorithms and convergence theory
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
Cited in
(3)
This page was built for publication: On pseudoinverse-free randomized methods for linear systems: unified framework and acceleration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6847405)
