Abstract

Interior point methods specialized to the L 1 fitting problem are surveyed and the affine-scaling primal method is presented. Their main features are highlighted and improvements are proposed for polynomial fitting problems. For such problems, a careful handling of data avoids storing of matrices for the interior point approaches. Moreover, the computational complexity of iterations is reduced. An inexpensive way to compute a basic solution, using interpolation, is also provided. Extensive numerical experiments are carried out, including comparisons with a specialized simplex method. In general, the interior point methods performed better than the simplex approach. Among the interior point methods investigated, the dual affine scaling version was the most efficient.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.