===firstname:
Jamie
===firstname3:
Deanna
===affil6:

===lastname3:
Needell
===email:
jhaddock@math.ucdavis.edu
===keyword_other2:

===lastname6:

===affil5:

===lastname4:

===lastname7:

===affil7:

===postal:
1860 Renoir Ave
Davis, CA 95618
===ABSTRACT:
We combine two algorithmic  techniques for solving 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. While we prove similar convergence results, our computational experiments show our algorithms often vastly outperform the original methods.
===affil3:
Claremont McKenna College
===title:
A Sampling Kaczmarz-Motzkin Algorithm for Linear Feasibility
===affil2:
University of California, Davis
===lastname2:
De Loera
===firstname4:

===keyword1:
Iterative Linear Algebraic Data Mining Techniques
===workshop:
no
===lastname:
Haddock
===firstname5:

===keyword2:
Optimization of Complex Problems/Systems
===otherauths:

===affil4:

===competition:
yes
===firstname7:

===firstname6:

===keyword_other1:

===lastname5:

===affilother:

===firstname2:
Jesus