Document Type


Publication Date



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. We obtain a family of algorithms that generalize and extend both projection-based techniques. We prove several convergence results, and our computational experiments show our algorithms often outperform the original methods.

Rights Information

© 2016 De Loera, Haddock, Needell

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

Included in

Mathematics Commons