A sampling Kaczmarz-Motzkin algorithm for linear feasibility

From MaRDI portal




Abstract: We combine two iterative algorithms for solving large-scale systems of linear inequalities, the relaxation method of Agmon, Motzkin et al. and the randomized Kaczmarz method. In doing so, we obtain a family of algorithms that generalize and extend both techniques. We prove several convergence results, and our computational experiments show our algorithms often outperform the original methods.



Cites work


Cited in
(44)


Describes a project that uses

Uses Software






This page was built for publication: A sampling Kaczmarz-Motzkin algorithm for linear feasibility

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