On Adaptive Sketch-and-Project for Solving Linear Systems
From MaRDI portal
Iterative numerical methods for linear systems (65F10) Probabilistic methods, particle methods, etc. for boundary value problems involving PDEs (65N75) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Analysis of algorithms (68W40) Quadratic programming (90C20)
Cites work
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- Block Kaczmarz method with inequalities
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Distributed coordinate descent method for learning with big data
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Efficiency of the accelerated coordinate descent method on structured optimization problems
- Efficient Generation of Logarithmically Distributed Pseudo-Random Variables
- Faster randomized block Kaczmarz algorithms
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- Greedy and randomized versions of the multiplicative Schwarz method
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- scientific article; zbMATH DE number 1271381 (Why is no real title available?)
- scientific article; zbMATH DE number 6982318 (Why is no real title available?)
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Methods of conjugate gradients for solving linear systems
- On greedy randomized coordinate descent methods for solving large linear least-squares problems.
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On Motzkin's method for inconsistent linear systems
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- On the complexity analysis of randomized block-coordinate descent methods
- On the convergence of the coordinate descent method for convex differentiable minimization
- On the relation between the randomized extended Kaczmarz algorithm and coordinate descent
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Random block coordinate descent methods for linearly constrained optimization over networks
- Randomized block Kaczmarz method with projection for solving least squares
- Randomized extended Kaczmarz for solving least squares
- Randomized iterative methods for linear systems
- Randomized methods for linear constraints: convergence rates and conditioning
- Randomized quasi-Newton updates are linearly convergent matrix inversion algorithms
- Single projection Kaczmarz extended algorithms
- Sparse matrix test problems
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Stochastic reformulations of linear systems: algorithms and convergence theory
- The mathematics of computerized tomography
- The Relaxation Method for Linear Inequalities
- The University of Florida sparse matrix collection
Cited in
(41)- On the regularization effect of stochastic gradient descent applied to least-squares
- On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation A X B = C
- On the relaxed greedy deterministic row and column iterative methods
- Block sampling Kaczmarz-Motzkin methods for consistent linear systems
- On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations
- Splitting-based randomized iterative methods for solving indefinite least squares problem
- Randomized block subsampling Kaczmarz-Motzkin method
- A weighted randomized Kaczmarz method for solving linear systems
- Surrounding the solution of a linear system of equations from all sides
- On block accelerations of quantile randomized Kaczmarz for corrupted systems of linear equations
- Adaptively sketched Bregman projection methods for linear systems
- Sketch‐and‐project methods for tensor linear systems
- Approximate Solutions of Linear Systems at a Universal Rate
- Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems
- Randomized Block Adaptive Linear System Solvers
- On convergence rates of Kaczmarz-type methods with different selection rules of working rows
- Faster randomized block sparse Kaczmarz by averaging
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- The method of randomized Bregman projections for stochastic feasibility problems
- Randomized Kaczmarz algorithm with averaging and block projection
- Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition
- Adaptive Sketch-and-Project Methods for Solving Linear Systems
- Greedy randomized sampling nonlinear Kaczmarz methods
- On adaptive stochastic heavy ball momentum for solving linear systems
- Stochastic iterative methods for online rank aggregation from pairwise comparisons
- Greedy capped nonlinear Kaczmarz methods
- Adaptive Bregman-Kaczmarz: an approach to solve linear inverse problems with independent noise exactly
- Greedy block extended Kaczmarz method for solving the least squares problems
- Acceleration and restart for the randomized Bregman-Kaczmarz method
- On greedy multi-step inertial randomized Kaczmarz method for solving linear systems
- Stochastic dual coordinate descent with adaptive heavy ball momentum for linearly constrained convex optimization
- On pseudoinverse-free randomized methods for linear systems: unified framework and acceleration
- A greedy randomized average block projection method for linear feasibility problems
- A unified convergence analysis of random sketch methods for rank deficient linear systems
- On sketch-and-project methods for solving tensor equations
- Randomized iterative methods for generalized absolute value equations: solvability and error bounds
- On greedy randomized coordinate updating iteration methods for solving symmetric eigenvalue problems
- A fast Bregman projection method for linearly constrained optimization problems
- Frontal slice approaches for tensor linear systems
- On a deterministic block Kaczmarz-type method and its acceleration for the solution of large-scale linear systems
- Subspace-constrained randomized coordinate descent for linear systems with good low-rank matrix approximations
This page was built for publication: On Adaptive Sketch-and-Project for Solving Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4997841)
