Abstract
Relationships between a linear l1 estimation problem and the Huber M-estimator problem can be easily established by their dual formulations. The least norm solution of a linear programming problem studied by Mangasarian and Meyer [SIAM J. Control Optim., 17 (1979), pp. 745--752] provides a key link between the dual problems. Based on the dual formulations, we establish a local linearity property of the Huber M-estimators with respect to the tuning parameter $\gamma$ and prove that the solution set of the Huber M-estimator problem is Lipschitz continuous with respect to perturbations of the tuning parameter $\gamma$. As a consequence, the set of the linear l1 estimators is the limit of the set of the Huber M-estimators as $\gamma\to 0+. Thus, the Huber M-estimator problem has many solutions for small tuning parameter $\gamma$ if the linear l1 estimation problem has multiple solutions. A recursive version of Madsen and Nielsen's algorithm [SIAM J. Optim., 3 (1993), pp. 223--235] based on computation of the Huber M-estimator is proposed for finding a linear l1 estimator.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
