Skip to main content
Log in

Algorithms to compute CM- and S-estimates for regression

  • Published:
Metrika Aims and scope Submit manuscript

Abstract.

Constrained M-estimators for regression were introduced by Mendes and Tyler in 1995 as an alternative class of robust regression estimators with high breakdown point and high asymptotic efficiency. To compute the CM-estimate, the global minimum of an objective function with an inequality constraint has to be localized. To find the S-estimate for the same problem, we instead restrict ourselves to the boundary of the feasible region. The algorithm presented for computing CM-estimates can easily be modified to compute S-estimates as well. Testing is carried out with a comparison to the algorithm SURREAL by Ruppert.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Arslan, O., Edlund, O. & Ekblom, H. Algorithms to compute CM- and S-estimates for regression. Metrika 55, 37–51 (2002). https://doi.org/10.1007/s001840200185

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001840200185

Navigation