IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/2685.html
   My bibliography  Save this paper

Solving the convex ordered set problem

Author

Listed:
  • Ahuja, Ravindra K., 1956-
  • Orlin, James B., 1953-

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:mit:sloanp:2685
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/2685
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Menendez, J. A. & Salvador, B., 1987. "An algorithm for isotonic median regression," Computational Statistics & Data Analysis, Elsevier, vol. 5(4), pages 399-406, September.
    2. 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.
    3. Nilotpal Chakravarti, 1989. "Isotonic Median Regression: A Linear Programming Approach," Mathematics of Operations Research, INFORMS, vol. 14(2), pages 303-308, May.
    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. 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. Nilotpal Chakravarti, 1992. "Isotonic median regression for orders representable by rooted trees," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 599-611, August.
    3. Garren Steven T., 2003. "Improved estimation of medians subject to order restrictions in unimodal symmetric families," Statistics & Risk Modeling, De Gruyter, vol. 21(4/2003), pages 367-380, April.
    4. Qian, Shixian, 1996. "An algorithm for tree-ordered isotonic median regression," Statistics & Probability Letters, Elsevier, vol. 27(3), pages 195-199, April.
    5. Calum Strange & Shawn Li & Richard Gilchrist & Gonçalo dos Reis, 2021. "Elbows of Internal Resistance Rise Curves in Li-Ion Cells," Energies, MDPI, vol. 14(4), pages 1-15, February.
    6. R. Khattree & D. P. Schmidt & I. E. Schochetman, 1999. "An Isotonic Regression Problem for Infinite-Dimensional Parameters," Journal of Optimization Theory and Applications, Springer, vol. 103(2), pages 359-384, November.

    More about this item

    Keywords

    HD28 .M414 no.3988-97;

    JEL classification:

    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:mit:sloanp:2685. 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: None (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.html .

    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.