The problem of finding a best approximation by a rational function to discrete data, using the l1 norm, is considered. An algorithm is developed which is frequently convergent in a finite number of steps, and failing this usually has a second-order convergence rate. Details are given of the application of the algorithm to a number of rational approximation problems.