Penalty calculations and branching rules in a LAV best subset procedure

Ronald D. Armstrong and P. O. Beck

Naval Research Logistics Quarterly, 1985, vol. 32, issue 3, 407-415

Abstract: Least absolute value (LAV) regression has become a widely accepted alternative to least squares regression. This has come about as the result of advancements in statistical theory and computational procedures to obtain LAV estimates. Computer codes are currently available to solve a wide range of LAV problems including the best subset regression. The purpose of this article is to study the use of penalty calculations and other branching rules in developing the solution tree for the best subset LAV regression.

Date: 1985
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800320305

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:32:y:1985:i:3:p:407-415

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().