An Improved Algorithm for Discrete L1 Linear Approximation

dc.contributor.authorBarrodale, I
dc.contributor.authorRoberts, F.D.K.
dc.date.accessioned2020-01-16T20:56:15Z
dc.date.available2020-01-16T20:56:15Z
dc.date.copyright1972en_US
dc.date.issued1972
dc.description.abstractBy 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.en_US
dc.description.reviewstatusRevieweden_US
dc.description.scholarlevelFacultyen_US
dc.description.sponsorshipWork sponsored by the United States Army under Contract No.: DA-31-124-ARO-D-462. Department of Mathematics, University of Victoria, Victoria, B.C., Canada.en_US
dc.identifier.citationBarrodale, I. & Roberts, F.D.K. (1972). An Improved Algorithm for Discrete L1 Linear Approximation. MRC Technical Summary Report #1172.en_US
dc.identifier.urihttp://hdl.handle.net/1828/11491
dc.language.isoenen_US
dc.publisherMRC Technical Summary Report #1172en_US
dc.titleAn Improved Algorithm for Discrete L1 Linear Approximationen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Barrodale_Ian_1972_rev.pdf
Size:
2.46 MB
Format:
Adobe Portable Document Format
Description:
Revised-January 23, 2020
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: