An efficient method for the discrete linear ๐ฟโ‚ approximation problem

Open Access
Publisher Website
Google Scholar
Abstract
An improved dual simplex algorithm for the solution of the discrete linear L 1 {L_1} approximation problem is described. In this algorithm certain intermediate iterations are skipped. This method is comparable with an improved simplex method due to Barrodale and Roberts, in both speed and number of iterations. It also has the advantage that in case of ill-conditioned problems, the basis matrix can lend itself to triangular factorization and can thus ensure a stable solution. Numerical results are given.