IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v27y1996i3p195-199.html
   My bibliography  Save this article

An algorithm for tree-ordered isotonic median regression

Author

Listed:
  • Qian, Shixian

Abstract

We develop a simple efficient algorithm for tree-ordered isotonic median regression.

Suggested Citation

  • Qian, Shixian, 1996. "An algorithm for tree-ordered isotonic median regression," Statistics & Probability Letters, Elsevier, vol. 27(3), pages 195-199, April.
    • Handle: RePEc:eee:stapro:v:27:y:1996:i:3:p:195-199
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0167-7152(95)00064-X
    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. Stromberg, Ulf, 1991. "An algorithm for isotonic regression with arbitrary convex distance function," Computational Statistics & Data Analysis, Elsevier, vol. 11(2), pages 205-219, March.
    2. Qian, Shixian, 1994. "The structure of isotonic regression class for LAD problems with quasi-order constraints," Computational Statistics & Data Analysis, Elsevier, vol. 18(4), pages 389-401, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Stout, Quentin F., 2008. "Unimodal regression via prefix isotonic regression," Computational Statistics & Data Analysis, Elsevier, vol. 53(2), pages 289-297, December.

    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. Ravindra K. Ahuja & James B. Orlin, 2001. "A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints," Operations Research, INFORMS, vol. 49(5), pages 784-789, October.
    2. Ahuja, Ravindra K., 1956- & Orlin, James B., 1953-, 1997. "Solving the convex ordered set problem," Working papers WP 3988-97., Massachusetts Institute of Technology (MIT), Sloan School of Management.

    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:stapro:v:27:y:1996:i:3:p:195-199. 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/wps/find/journaldescription.cws_home/622892/description#description .

    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.