An efficient method for the discrete linear L1 approximation problem

Download
  1. Get@NRC: An efficient method for the discrete linear L1 approximation problem (Opens in a new window)
DOIResolve DOI: http://doi.org/10.2307/2005296
AuthorSearch for:
TypeArticle
Journal titleMathematics of Computation
ISSN0025-5718
Volume29
Issue131
Pages844850; # of pages: 7
AbstractAn improved dual simplex algorithm for the solution of the discrete linear L1 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.
Publication date
LanguageEnglish
AffiliationNational Research Council Canada
Peer reviewedYes
NRC number16554
NPARC number21273613
Export citationExport as RIS
Report a correctionReport a correction
Record identifier7b9e1ee4-c730-4c77-b926-51e4c407bb6c
Record created2015-01-16
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)