IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v41y1993i4p759-767.html
   My bibliography  Save this article

A Family of Search Directions for Karmarkar's Algorithm

Author

Listed:
  • Kurt M. Anstreicher

    (University of Iowa, Iowa City, Iowa)

  • Patrick Watteyne

    (Université Catholique de Louvain, Louvain-la-Neuve, Belgium)

Abstract

We consider a new family of search directions for the standard form variant of Karmarkar's projective linear programming algorithm. The family includes the usual projected gradient direction, and also a direction first proposed by Mike Todd. We prove that any choice from the family preserves the algorithm's polynomial-time complexity. We then examine the computational behavior of the algorithm using different choices of directions. Although the theoretical complexity is the same for the different directions, in practice we find wide variations in algorithm performance. One particular choice consistently requires about 20% fewer iterations than the usual direction, while another requires a number of iterations which grows rapidly with problem size. Our computational results also demonstrate that a small number of monotonic steps on early iterations may considerably improve the performance of the algorithm.

Suggested Citation

  • Kurt M. Anstreicher & Patrick Watteyne, 1993. "A Family of Search Directions for Karmarkar's Algorithm," Operations Research, INFORMS, vol. 41(4), pages 759-767, August.
  • Handle: RePEc:inm:oropre:v:41:y:1993:i:4:p:759-767
    DOI: 10.1287/opre.41.4.759
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.41.4.759
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.41.4.759?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
    ---><---

    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:oropre:v:41:y:1993:i:4:p:759-767. 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.