Abstract
With the proliferation of personal computers and the increased interest in robust estimation, a capability of efficiently solving large-scale least absolute value (LAV) problems on a microcomputer would be useful. Least absolute value estimation has gained wide acceptance as a robust alternative to least squares. This paper presents an algorithm for least absolute value estimation which utilizes a Lagrangian decomposition, so that only a small percentage of the linear programming constraints need to be considered during an iteration. One advantage of this method is that it provides the capability of solving large-scale LAV problems on a system where memory requirements are a consideration.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.