An Improved Algorithm for Discrete $l_1 $ Linear Approximation

Abstract

By modifying the simplex method of linear programming, we are able to present an algorithm for $l_1 $-approximation which appears to, be superior computationally to any other known algorithm for this problem.