Abstract
The paper presents a numerical method for computing the projections for Karmarkar's new algorithm for linear programming. The method is simple to implement, fully exploits sparsity, and appears in limited experimentation to have good stability properties. Preliminary numerical experience indicates that the method promises advantages over methods that refactor a matrix at every iteration.
Similar content being viewed by others
References
K.M. Anstreicher, “A monotonic projective algorithm for fractional linear programming,”Algorithmica 1 (1986) 483–498.
R. Fletcher and M.J.D. Powell, “On the modification ofLDL T factorizations,”Mathematics of Computation 28 (1974) 1067–1087.
D.M. Gay, “A variant of Karmarkar's linear programming algorithm for problems in standard form,”Mathematical Programming 37 (1987) 81–90.
P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, “On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,”Mathematical Programming 36 (1986) 183–209.
N. Karmarkar, “A new polynomial-time algorithm for linear programming,”Combinatorica 4 (1984) 373–393.
D.F. Shanno and R.E. Marsten, “On implementing Karmarkar's method,” Working Paper 85-01, Graduate School of Administration, UC Davis (Davis, CA, 1985).
M.J. Todd and B.P. Burrell, “An extension of Karmarkar's algorithm for linear programming using dual variables,”Algorithmica 1 (1986) 409–424.
J.A. Tomlin, “An experimental approach to Karmarkar's projective method for linear programming,”Mathematical Programming Study 31 (1987) 175–191.
Author information
Authors and Affiliations
Additional information
Research sponsored by the Air Force Office of Scientific Research, Air Force Systems Command, USAF under Grant AFOSR-86-0170. The US Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.
This work was initiated while the author was at the Graduate School of Administration, University of California, Davis, Davis, California.
Rights and permissions
About this article
Cite this article
Shanno, D.F. Computing Karmarkar projections quickly. Mathematical Programming 41, 61–71 (1988). https://doi.org/10.1007/BF01580753
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580753