Journal article
A Family of Search Directions for Karmarkar's Algorithm
Operations research, Vol.41(4), pp.759-767
07/01/1993
DOI: 10.1287/opre.41.4.759
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.
Details
- Title: Subtitle
- A Family of Search Directions for Karmarkar's Algorithm
- Creators
- Kurt M. Anstreicher - University of IowaPatrick Watteyne - UCLouvain
- Resource Type
- Journal article
- Publication Details
- Operations research, Vol.41(4), pp.759-767
- DOI
- 10.1287/opre.41.4.759
- ISSN
- 0030-364X
- eISSN
- 1526-5463
- Language
- English
- Date published
- 07/01/1993
- Academic Unit
- Industrial and Systems Engineering; Computer Science; Business Analytics
- Record Identifier
- 9984380582902771
Metrics
5 Record Views