A modified layered-step interior-point algorithm for linear programming

Mathematical Programming, Series B

Volumn 82, Issue 3, 1998, Pages 339-355

  Megiddo, Nimrod ^a,b   Mizuno, Shinji ^c   Tsuchiya, Takashi ^c  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

Author keywords

Crossover events; Layered step interior point method; Linear programming; Path of centers

Indexed keywords

EID: 0000328359     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01580074     Document Type: Article

References (15)

1. N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373-395.
2. S. Vavasis, Y. Ye, A primal-dual accelerated interior point method whose running time depends only on A, Mathematical Programming 74 (1996) 79-120.
3. É. Tardos, A strongly polynomial algorithm to solve combinatorial linear programs, Operations Research 34 (1986) 250-256.
4. M. Kojima, S. Mizuno, A. Yoshise, A polynomial-time algorithm for a class of linear complementary problems, Mathematical Programming 44 (1989) 1-26.
5. R.D.C. Monteiro, I. Adler, Interior path following primal-dual algorithms. Part I: Linear programming, Mathematical Programming 44 (1989) 27-41.
6. S. Mizuno, M.J. Todd, Y. Ye, On adaptive-step primal-dual interior-point algorithms for linear programming, Mathematics of Operations Research 18 (1993) 964-981.
7. I.I. Dikin, V.I. Zorkalcev, Iterative Solution of Mathematical Programming Problems: Algorithms for the Method of Interior Points (in Russian), Nauka, Novosibirsk, USSR, 1980.
8. R.J. Vanderbei, J.C. Lagarias, I.I. Dikin's convergence result for the affine-scaling algorithm, Contemporary Mathematics 114 (1990) 109-119.
9. M.J. Todd, A Dantzig-Wolfe-like variant of Karmarkar's interior-point linear programming algorithm, Operations Research 38 (1990) 1006-1018.
10. G.W. Stewart, On scaled projections and pseudoinverses, Linear Algebra and its Applications 112 (1989) 189-193.
11. S. Vavasis, Y. Ye, A simplification to a primal-dual interior point method whose running time depends only on the constaint matrix, Technical Note, Department of Management Science, University of Iowa, Iowa City (1997).
12. S. Mizuno, N. Megiddo, T. Tsuchiya, A linear programming instance with many crossover events, Journal of Complexity 12 (1996) 474-479.
13. T. Tsuchiya, Global convergence property of the affine scaling method for primal degenerate linear programming problems, Mathematics of Operations Research 17 (1992) 527-557.
14. J.M. Bennett, Triangular factors of modified matrices, Numerische Mathematik 7 (1965) 217-221.
15. P.E. Gill, G.H. Golub, W. Murray, M.A. Saunders, Methods for modifying matrix factorization, Mathematics of Computation 28 (1974) 505-535.