Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm

Mathematical Programming, Series B

Volumn 72, Issue 3, 1996, Pages 291-305

  Muramatsu, Masakazu ^a   Tsuchiya, Takashi ^b  

^a SOPHIA UNIVERSITY   (Japan)

^b INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

Author keywords

Convergence analysis; Interior point methods; Linear programming; Long step algorithm; Polynomial time algorithm; Projective scaling algorithm

Indexed keywords

EID: 0012033076     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592094     Document Type: Article

References (21)

1. I. Adler and R.D.C. Monteiro, "Limiting behavior of the affine scaling continuous trajectories for linear programming problems," Mathematical Programming 50 (1991) 29-51.
2. K.M. Anstreicher, "A monotonic projective algorithm for fractional linear programming," Algorithmica 1 (1986) 483-498.
3. K.M. Anstreicher, "The worst-case step in Karmarkar's algorithm," Mathematics of Operations Research 14 (1989) 294-302.
4. K.M. Anstreicher, "On the performance of Karmarkar's algorithm over a sequence of iterations," SIAM Journal on Optimization 1 (1991) 22-29.
5. E.R. Barnes, "A variation on Karmarkar's algorithm for solving linear programming problems," Mathematical Programming 36 (1986) 174-182.
6. D.A. Bayer and J.C. Lagarias, "The nonlinear geometry of linear programming: I. Affine and projective trajectories," Transactions of the American Mathematical Society 314 (1989) 499-526.
7. I.I. Dikin, "Iterative solution of problems of linear and quadratic programming," Soviet Mathematics Doklady 8 (1967) 674-675.
8. I.I. Dikin, "The convergence of dual variables," Technical Report, Siberian Energy Institute, Irkutsk (1991).
9. D.M. Gay, "A variant of Karmarkar's linear programming algorithm for problems in standard form," Mathematical Programming 37 (1987) 81-90.
10. C.C. Gonzaga, "Conical projection algorithms for linear programming," Mathematical Programming 43 (1989) 151-173.
11. N. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica 4 (1984) 373-395.
12. C. McDiarmid, "On the improvement per iteration in Karmarkar's algorithm for linear programming," Mathematical Programming 46 (1990) 299-320.
13. R.D.C. Monteiro, T. Tsuchiya and Y. Wang, "A simplified global convergence proof of the affine scaling algorithm," Annals of Operations Research 7 (1993) 443-482.
14. Yu.E. Nesterov and M.J. Todd, "Self-scaled barriers and interior-point methods for convex programming," Technical Report, School of OR/IE, Cornell University, Ithaca, NY (1995).
15. R. Saigal, "A simple proof of primal affine scaling method," Technical Report, University of Michigan, Ann Arbor MI (1992).
16. M.J. Todd, "Potential reduction methods in mathematical programming," Technical Report, School of OR/IE, Cornell University, Ithaca, NY (1995).
17. M.J. Todd and B.P. Burrell, "An extension of Karmarkar's algorithm for linear programming using dual variables," Algorithmica 1 (1986) 409-424.
18. T. Tsuchiya and M. Muramatsu, "Global convergence of a long-step affine scaling algorithm for degenerate linear programming problems," SIAM Journal on Optimization 5 (1995) 525-551.
19. R.J. Vanderbei and J.C. Lagarias, "I.I. Dikin's convergence result for the affine-scaling algorithm," Contemporary Mathematics 114 (1990) 109-119.
20. R.J. Vanderbei, M.S. Meketon and B.A. Freedman, "A modification of Karmarkar's linear programing algorithm," Algorithmica 1 (1986) 395-407.
21. Y. Ye and M. Kojima, "Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming," Mathematical Programming 39 (1987) 305-317.