IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v22y1975i1p42-50.html
   My bibliography  Save this article

An Efficient One Dimensional Search Procedure

Author

Listed:
  • R. L. Fox

    (Case Western Reserve University)

  • L. S. Lasdon

    (Case Western Reserve University)

  • Arie Tamir

    (Graduate School of Management, Northwestern University)

  • Margery Ratner

    (Computer and Information Sciences, Case Western Reserve University)

Abstract

Many nonlinear programming algorithms utilize a one-dimensional search along directions generated by the algorithm. This paper describes a method for performing this search. The method finds 3 points which bracket the minimum, fits a quadratic through them to yield a fourth point, then fits successive cubics through 4 points, discarding one each time, until certain stop criteria are met. No gradient evaluations are required. Detailed flow charts of this procedure are given, and its performance is compared with that of 2 other algorithms. Eight test problems are used in this comparison, each solved using both exterior and interior penalty functions. The Davidon-Fleteher-Powell method is used to generate the search directions. Results show that the proposed procedure requires about 1/2 to 3/4 to the computer time of its nearest competitor, a procedure designed to be especially efficient when applied to penalty functions, and about 1/3 the time of the other competitor, the 2 point cubic search using derivatives.

Suggested Citation

  • R. L. Fox & L. S. Lasdon & Arie Tamir & Margery Ratner, 1975. "An Efficient One Dimensional Search Procedure," Management Science, INFORMS, vol. 22(1), pages 42-50, September.
    • Handle: RePEc:inm:ormnsc:v:22:y:1975:i:1:p:42-50
    DOI: 10.1287/mnsc.22.1.42
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.22.1.42
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.22.1.42?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
    ---><---

    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:inm:ormnsc:v:22:y:1975:i:1:p:42-50. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.