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

Computing the least quartile difference estimator in the plane

Author

Listed:
  • Bernholt, Thorsten
  • Nunkesser, Robin
  • Schettlinger, Karen

Abstract

No abstract is available for this item.

Suggested Citation

  • Bernholt, Thorsten & Nunkesser, Robin & Schettlinger, Karen, 2007. "Computing the least quartile difference estimator in the plane," Computational Statistics & Data Analysis, Elsevier, vol. 52(2), pages 763-772, October.
    • Handle: RePEc:eee:csdana:v:52:y:2007:i:2:p:763-772
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-9473(06)00515-9
    Download Restriction: Full text for ScienceDirect subscribers only.
    ---><---

    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. Ian L. Dryden & Gary Walker, 1999. "Highly Resistant Regression and Object Matching," Biometrics, The International Biometric Society, vol. 55(3), pages 820-825, September.
    2. Walter R. Mebane & Jasjeet S. Sekhon, 2004. "Robust Estimation and Outlier Detection for Overdispersed Multinomial Models of Count Data," American Journal of Political Science, John Wiley & Sons, vol. 48(2), pages 392-411, April.
    3. Hossjer, O. & Croux, C. & Rousseeuw, P. J., 1994. "Asymptotics of Generalized S-Estimators," Journal of Multivariate Analysis, Elsevier, vol. 51(1), pages 148-177, October.
    4. Barreto, Humberto & Maharry, David, 2006. "Least median of squares and regression through the origin," Computational Statistics & Data Analysis, Elsevier, vol. 50(6), pages 1391-1397, March.
    5. Nimrod Megiddo, 1979. "Combinatorial Optimization with Rational Objective Functions," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 414-424, November.
    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. Bernholt, Thorsten & Nunkesser, Robin & Schettlinger, Karen, 2005. "Computing the Least Quartile Difference Estimator in the Plane," Technical Reports 2005,51, Technische Universität Dortmund, Sonderforschungsbereich 475: Komplexitätsreduktion in multivariaten Datenstrukturen.
    2. Steffen Rebennack & Ashwin Arulselvan & Lily Elefteriadou & Panos M. Pardalos, 2010. "Complexity analysis for maximum flow problems with arc reversals," Journal of Combinatorial Optimization, Springer, vol. 19(2), pages 200-216, February.
    3. Bart Smeulders & Laurens Cherchye & Bram De Rock & Frits C. R. Spieksma, 2013. "The Money Pump as a Measure of Revealed Preference Violations: A Comment," Journal of Political Economy, University of Chicago Press, vol. 121(6), pages 1248-1258.
    4. W. Ip & Ying Yang & P. Kwan & Y. Kwan, 2003. "Strong convergence rate of the least median absolute estimator in linear regression models," Statistical Papers, Springer, vol. 44(2), pages 183-201, April.
    5. Nunkesser, Robin & Morell, Oliver, 2010. "An evolutionary algorithm for robust regression," Computational Statistics & Data Analysis, Elsevier, vol. 54(12), pages 3242-3248, December.
    6. Hassin, Refael & Sarid, Anna, 2018. "Operations research applications of dichotomous search," European Journal of Operational Research, Elsevier, vol. 265(3), pages 795-812.
    7. Pursals, Salvador Casadesús & Garzón, Federico Garriga, 2009. "Optimal building evacuation time considering evacuation routes," European Journal of Operational Research, Elsevier, vol. 192(2), pages 692-699, January.
    8. Michael Holzhauser & Sven O. Krumke & Clemens Thielen, 2016. "Budget-constrained minimum cost flows," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1720-1745, May.
    9. Miron, Julien & Poilane, Benjamin & Cantoni, Eva, 2022. "Robust polytomous logistic regression," Computational Statistics & Data Analysis, Elsevier, vol. 176(C).
    10. Jianzhong Zhang & Zhenhong Liu, 2002. "A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l ∞ Norm," Journal of Combinatorial Optimization, Springer, vol. 6(2), pages 207-227, June.
    11. Evgeny Gurevsky & Sergey Kovalev & Mikhail Y. Kovalyov, 2021. "Min-max controllable risk problems," 4OR, Springer, vol. 19(1), pages 93-101, March.
    12. Sergio Cabello, 2023. "Faster distance-based representative skyline and k-center along pareto front in the plane," Journal of Global Optimization, Springer, vol. 86(2), pages 441-466, June.
    13. Andrés Gómez & Oleg A. Prokopyev, 2021. "A Mixed-Integer Fractional Optimization Approach to Best Subset Selection," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 551-565, May.
    14. Akiyoshi Shioura, 2015. "Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 192-225, February.
    15. Roelant, E. & Van Aelst, S. & Croux, C., 2009. "Multivariate generalized S-estimators," Journal of Multivariate Analysis, Elsevier, vol. 100(5), pages 876-887, May.
    16. Cerioli, Andrea & Farcomeni, Alessio & Riani, Marco, 2014. "Strong consistency and robustness of the Forward Search estimator of multivariate location and scatter," Journal of Multivariate Analysis, Elsevier, vol. 126(C), pages 167-183.
    17. Danny Z. Chen & Ovidiu Daescu & Yang Dai & Naoki Katoh & Xiaodong Wu & Jinhui Xu, 2005. "Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications," Journal of Combinatorial Optimization, Springer, vol. 9(1), pages 69-90, February.
    18. Hong Zheng & Yi-Chang Chiu & Pitu B. Mirchandani, 2015. "On the System Optimum Dynamic Traffic Assignment and Earliest Arrival Flow Problems," Transportation Science, INFORMS, vol. 49(1), pages 13-27, February.
    19. Chakravarti, N. & Wagelmans, A.P.M., 1997. "Calculation of Stability Radii for Combinatorial Optimization Problems," Econometric Institute Research Papers EI 9740/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    20. Johannes O. Royset & R. Kevin Wood, 2007. "Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 175-184, May.

    More about this item

    Statistics

    Access and download statistics

    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:52:y:2007:i:2:p:763-772. 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.