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

Golden Block Search for the Maximum of Unimodal Functions

Author

Listed:
  • Mordecai Avriel

    (Mobil Research and Development Corporation, Princeton, New Jersey)

  • Douglass J. Wilde

    (Stanford University)

Abstract

In a previous paper [Avriel, M., D. J. Wilde. 1966. Optimal search for a maximum with sequences of simultaneous function evaluations. Management Sci. 12 722.], the authors presented the minimax block search strategy for locating the maximum of unimodal functions of one variable by a sequence of simultaneous function evaluations. In the present work the nearly optimal minimax golden block search method is developed which has the advantage that the number of function evaluations need not be specified in advance. For one experiment per block it reduces to the well known golden section method. It is shown that this method is an excellent approximation of the block search strategy and that for a certain marginal resolution the two methods become identical.

Suggested Citation

  • Mordecai Avriel & Douglass J. Wilde, 1968. "Golden Block Search for the Maximum of Unimodal Functions," Management Science, INFORMS, vol. 14(5), pages 307-319, January.
    • Handle: RePEc:inm:ormnsc:v:14:y:1968:i:5:p:307-319
    DOI: 10.1287/mnsc.14.5.307
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.14.5.307
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.14.5.307?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:14:y:1968:i:5:p:307-319. 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.