A Family of Search Directions for Karmarkar's Algorithm

Kurt M. Anstreicher and Patrick Watteyne
Additional contact information
Kurt M. Anstreicher: University of Iowa, Iowa City, Iowa
Patrick Watteyne: Université Catholique de Louvain, Louvain-la-Neuve, Belgium

Operations Research, 1993, vol. 41, issue 4, 759-767

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.

Keywords: programming; linear; algorithms: directions for projective algorithm (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.41.4.759 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:41:y:1993:i:4:p:759-767

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().