Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

An Improved Algorithm for Discrete l1 Linear Approximation

I. Barrodale and F. D. K. Roberts
SIAM Journal on Numerical Analysis
Vol. 10, No. 5 (Oct., 1973), pp. 839-848
Stable URL: http://www.jstor.org/stable/2156318
Page Count: 10
  • Subscribe ($19.50)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
An Improved Algorithm for Discrete l1 Linear Approximation
Preview not available

Abstract

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

Page Thumbnails

  • Thumbnail: Page 
839
    839
  • Thumbnail: Page 
840
    840
  • Thumbnail: Page 
841
    841
  • Thumbnail: Page 
842
    842
  • Thumbnail: Page 
843
    843
  • Thumbnail: Page 
844
    844
  • Thumbnail: Page 
845
    845
  • Thumbnail: Page 
846
    846
  • Thumbnail: Page 
847
    847
  • Thumbnail: Page 
848
    848