A greedy randomized average block projection method for linear feasibility problems

Cites work

scientific article; zbMATH DE number 3027894 (Why is no real title available?)
A randomized Kaczmarz algorithm with exponential convergence
A sampling Kaczmarz-Motzkin algorithm for linear feasibility
A weighted randomized Kaczmarz method for solving linear systems
Adaptively sketched Bregman projection methods for linear systems
Column subset selection, matrix factorization, and eigenvalue optimization
Extensions of Hildreth’s Row-Action Method for Quadratic Programming
Faster randomized block Kaczmarz algorithms
Hildreth's algorithm with applications to soft constraints for user interface layout
New characterizations of Hoffman constants for systems of linear constraints
On Adaptive Sketch-and-Project for Solving Linear Systems
On adaptive stochastic heavy ball momentum for solving linear systems
On greedy multi-step inertial randomized Kaczmarz method for solving linear systems
On greedy randomized Kaczmarz method for solving large sparse linear systems
On greedy randomized augmented Kaczmarz method for solving large sparse inconsistent linear systems
On greedy randomized average block Kaczmarz method for solving large linear systems
On pseudoinverse-free randomized methods for linear systems: unified framework and acceleration
On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
On the convergence properties of Hildreth's quadratic programming algorithm
Paved with good intentions: analysis of a randomized block Kaczmarz method
Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
Randomized Kaczmarz with averaging
Randomized extended average block Kaczmarz for solving least squares
Randomized methods for linear constraints: convergence rates and conditioning
Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
Subset selection for matrices with fixed blocks
The Relaxation Method for Linear Inequalities
The Relaxation Method for Linear Inequalities
The University of Florida sparse matrix collection

This page was built for publication: A greedy randomized average block projection method for linear feasibility problems

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