IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v84y2015icp27-40.html
   My bibliography  Save this article

An exact polynomial time algorithm for computing the least trimmed squares estimate

Author

Listed:
  • Klouda, Karel

Abstract

An exact algorithm for computing the estimates of regression coefficients given by the least trimmed squares method is presented. The algorithm works under very weak assumptions and has polynomial complexity. Simulations show that in the case of two or three explanatory variables, the presented algorithm is often faster than the exact algorithms based on a branch-and-bound strategy whose complexity is not known. The idea behind the algorithm is based on a theoretical analysis of the respective objective function, which is also given.

Suggested Citation

  • Klouda, Karel, 2015. "An exact polynomial time algorithm for computing the least trimmed squares estimate," Computational Statistics & Data Analysis, Elsevier, vol. 84(C), pages 27-40.
    • Handle: RePEc:eee:csdana:v:84:y:2015:i:c:p:27-40
    DOI: 10.1016/j.csda.2014.11.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947314003144
    Download Restriction: Full text for ScienceDirect subscribers only.
    File URL: https://libkey.io/10.1016/j.csda.2014.11.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hawkins, Douglas M., 1994. "The feasible solution algorithm for least trimmed squares regression," Computational Statistics & Data Analysis, Elsevier, vol. 17(2), pages 185-196, February.
    2. Hawkins, Douglas M. & Olive, David, 1999. "Applications and algorithms for least trimmed sum of absolute deviations regression," Computational Statistics & Data Analysis, Elsevier, vol. 32(2), pages 119-134, December.
    3. Hofmann, Marc & Kontoghiorghes, Erricos John, 2010. "Matrix strategies for computing the least trimmed squares estimation of the general linear and SUR models," Computational Statistics & Data Analysis, Elsevier, vol. 54(12), pages 3392-3403, December.
    4. Hawkins, Douglas M. & Olive, David J., 1999. "Improved feasible solution algorithms for high breakdown estimation," Computational Statistics & Data Analysis, Elsevier, vol. 30(1), pages 1-11, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mount, David M. & Netanyahu, Nathan S. & Piatko, Christine D. & Wu, Angela Y. & Silverman, Ruth, 2016. "A practical approximation algorithm for the LTS estimator," Computational Statistics & Data Analysis, Elsevier, vol. 99(C), pages 148-170.
    2. Agullo, Jose, 2001. "New algorithms for computing the least trimmed squares regression estimator," Computational Statistics & Data Analysis, Elsevier, vol. 36(4), pages 425-439, June.
    3. Čížek, Pavel, 2008. "General Trimmed Estimation: Robust Approach To Nonlinear And Limited Dependent Variable Models," Econometric Theory, Cambridge University Press, vol. 24(6), pages 1500-1529, December.
    4. Vanessa Berenguer-Rico & Søren Johansen & Bent Nielsen, 2019. "Models where the Least Trimmed Squares and Least Median of Squares estimators are maximum likelihood," CREATES Research Papers 2019-15, Department of Economics and Business Economics, Aarhus University.
    5. Selin Ahipaşaoğlu, 2015. "Fast algorithms for the minimum volume estimator," Journal of Global Optimization, Springer, vol. 62(2), pages 351-370, June.
    6. Olive, David J. & Hawkins, Douglas M., 2003. "Robust regression with high coverage," Statistics & Probability Letters, Elsevier, vol. 63(3), pages 259-266, July.
    7. Neykov, N.M. & Čížek, P. & Filzmoser, P. & Neytchev, P.N., 2012. "The least trimmed quantile regression," Computational Statistics & Data Analysis, Elsevier, vol. 56(6), pages 1757-1770.
    8. Mafusalov, Alexander & Uryasev, Stan, 2016. "CVaR (superquantile) norm: Stochastic case," European Journal of Operational Research, Elsevier, vol. 249(1), pages 200-208.
    9. Nunkesser, Robin & Morell, Oliver, 2008. "Evolutionary algorithms for robust methods," Technical Reports 2008,29, Technische Universität Dortmund, Sonderforschungsbereich 475: Komplexitätsreduktion in multivariaten Datenstrukturen.
    10. Olive, David J., 2004. "A resistant estimator of multivariate location and dispersion," Computational Statistics & Data Analysis, Elsevier, vol. 46(1), pages 93-102, May.
    11. Sven Jäger & Anita Schöbel, 2020. "The blockwise coordinate descent method for integer programs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 91(2), pages 357-381, April.
    12. Nguyen, T.D. & Welsch, R., 2010. "Outlier detection and least trimmed squares approximation using semi-definite programming," Computational Statistics & Data Analysis, Elsevier, vol. 54(12), pages 3212-3226, December.
    13. Hawkins, Douglas M. & Olive, David, 1999. "Applications and algorithms for least trimmed sum of absolute deviations regression," Computational Statistics & Data Analysis, Elsevier, vol. 32(2), pages 119-134, December.
    14. Hawkins, Douglas M., 1995. "Convergence of the feasible solution algorithm for least median of squares regression," Computational Statistics & Data Analysis, Elsevier, vol. 19(5), pages 519-538, May.
    15. Schyns, M. & Haesbroeck, G. & Critchley, F., 2010. "RelaxMCD: Smooth optimisation for the Minimum Covariance Determinant estimator," Computational Statistics & Data Analysis, Elsevier, vol. 54(4), pages 843-857, April.
    16. Jung, Kang-Mo, 2005. "Multivariate least-trimmed squares regression estimator," Computational Statistics & Data Analysis, Elsevier, vol. 48(2), pages 307-316, February.
    17. Bernholt, Thorsten, 2006. "Robust Estimators are Hard to Compute," Technical Reports 2005,52, Technische Universität Dortmund, Sonderforschungsbereich 475: Komplexitätsreduktion in multivariaten Datenstrukturen.
    18. Cizek, P., 2004. "Asymptotics of Least Trimmed Squares Regression," Other publications TiSEM dab5d551-aca6-40bf-b92e-c, Tilburg University, School of Economics and Management.
    19. Olive, David J., 2005. "Two simple resistant regression estimators," Computational Statistics & Data Analysis, Elsevier, vol. 49(3), pages 809-819, June.
    20. L. Pitsoulis & G. Zioutas, 2010. "A fast algorithm for robust regression with penalised trimmed squares," Computational Statistics, Springer, vol. 25(4), pages 663-689, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:84:y:2015:i:c:p:27-40. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.