IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v22y1975i2p399-404.html
   My bibliography  Save this article

An efficient cyclic coordinate method for optimizing penalty functions

Author

Listed:
  • Mokhtar S. Bazaraa

Abstract

In this study, a simple and efficient cyclic coordinate search procedure is used to optimize penalty functions. Since the contours of the penalty function are very ill‐behaved, an accurate line search is very difficult to achieve. Due to accumulated errors in line search, this makes “simple‐minded” search directions just as good as more sophisticated directions, and actually better since they require a smaller effort per iteration. Of course this is only true if the search procedure is able to “ride” along steep ridges, and meanwhile move an appreciable distance towards the optimal, if at all possible. Computational results on the cyclic coordinate method seems to support this point of view, and shows robustness, reliability, and efficiency of the method.

Suggested Citation

  • Mokhtar S. Bazaraa, 1975. "An efficient cyclic coordinate method for optimizing penalty functions," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 22(2), pages 399-404, June.
    • Handle: RePEc:wly:navlog:v:22:y:1975:i:2:p:399-404
    DOI: 10.1002/nav.3800220215
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800220215
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800220215?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
    ---><---

    Citations

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


    Cited by:

    1. Luzon, Yossi & Pinchover, Rotem & Khmelnitsky, Eugene, 2022. "Dynamic budget allocation for social media advertising campaigns: optimization and learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 223-234.

    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:wly:navlog:v:22:y:1975:i:2:p:399-404. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.