Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations
From MaRDI portal
Publication:5071437
DOI10.1137/21M1429187zbMath1492.65078arXiv2009.08089OpenAlexW3086603490MaRDI QIDQ5071437
Deanna Needell, William J. Swartworth, Elizaveta Rebrova, Jamie Haddock
Publication date: 21 April 2022
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.08089
least squares problemsKaczmarz methodquantile methodsstochastic iterative methodscorrupted linear systems
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)
Related Items
On block accelerations of quantile randomized Kaczmarz for corrupted systems of linear equations, Approximate Solutions of Linear Systems at a Universal Rate
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single projection Kaczmarz extended algorithms
- A mathematical introduction to compressive sensing
- Block-iterative methods for consistent and inconsistent linear equations
- Algorithms for unconstrained \(L_ 1\) simple linear regression
- On the acceleration of Kaczmarz's method for inconsistent linear systems
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Incorporation of a priori moment information into signal recovery and synthesis problems
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- Block-projections algorithms with blocks containing mutually orthogonal rows and columns
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- On Motzkin's method for inconsistent linear systems
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
- On block Gaussian sketching for the Kaczmarz method
- Hildreth's algorithm with applications to soft constraints for user interface layout
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Randomized Extended Kaczmarz for Solving Least Squares
- Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Small Ball Probabilities for Linear Images of High-Dimensional Distributions
- Decoding by Linear Programming
- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
- A new descent algorithm for the least absolute value regression problem
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Least Absolute Deviations Curve-Fitting
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Optimization Methods for Large-Scale Machine Learning
- High-Dimensional Probability
- An Iterative Technique for Absolute Deviations Curve Fitting
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- Non-convex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent
- Revisiting Randomized Gossip Algorithms: General Framework, Convergence Rates and Novel Block and Accelerated Protocols
- Randomized Extended Average Block Kaczmarz for Solving Least Squares
- Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
- Dense Error Correction Via $\ell^1$-Minimization
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility
- Optimal Distributed Online Prediction using Mini-Batches
- An Improved Algorithm for Discrete $l_1 $ Linear Approximation
- A Stochastic Approximation Method
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
