Superlinear convergence of the affine scaling algorithm

Mathematical Programming, Series B

Volumn 75, Issue 1, 1996, Pages 77-110

  Tsuchiya, T ^a   Monteiro, R D C ^b  

^a INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

^b Georgia Institute of Technology   (United States)

Author keywords

Affine scaling algorithm; Global convergence; Interior point algorithms; Linear programming; Superlinear convergence

Indexed keywords

EID: 0002482037     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592206     Document Type: Article

References (34)

1. I. Adler, N.K. Karmarkar, M.G.C. Resende and G. Veiga, "Data structures and programming techniques for the implementation of Karmarkar's algorithm," ORSA Journal on Computing 1 (1989) 84-106.
2. I. Adler, N.K. Karmarkar, M.G.C. Resende and G. Veiga, "An implementation of Karmarkar's algorithm for linear programming," Mathematical Programming 44 (1989) 297-335. (Errata in Mathematical Programming 50 (1991) 415.)
3. 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.
4. E.R. Barnes, "A variation on Karmarkar's algorithm for solving linear programming problems," Mathematical Programming 36 (1986) 174-182.
5. Y-C. Cheng, D.J. Houck, J.-M. Liu, M.S. Meketon, L. Slutsman, R.J. Vanderbei and P. Wang, "The AT&T KORBX System", AT&T Technical Journal 68 (3) (1989) 7-19.
6. I.I. Dikin, "Iterative solution of problems of linear and quadratic programming," Doklady Akademii Nauk SSSR 174 (1967) 747-748. (Translated in: Soviet Mathematics Doklady 8 (1967) 674-675.)
7. I.I. Dikin, "Iterative solution of problems of linear and quadratic programming," Doklady Akademii Nauk SSSR 174 (1967) 747-748. (Translated in: Soviet Mathematics Doklady 8 (1967) 674-675.)
8. I.I. Dikin, "On the convergence of an iterative process," Upravlyaemye Sistemi 12 (1974) 54-60 (In Russian).
9. I.I. Dikin, "The convergence of dual variables," Technical Report Siberian Energy Institute (Irkutsk, Russia, December 1991).
10. I.I. Dikin, "Determination of the interior point of one system of linear inequalities," Kibernetica and System Analysis 1 (1992).
11. I.I. Dikin and V.I. Zorkaltsev, Iterative Solutions of Mathematical Programming Problems (Nauka, Novosibirsk, USSR, 1980).
12. R. Fletcher, Practical Methods of Optimization, 2nd edition (Wiley, New York, 1987).
13. C.C. Gonzaga, "Convergence of the large step primal affine-scaling algorithm for primal nondegenerate linear programs," Technical Report, ES-230/90, Dept. of Systems Engineering and Computer Science, COPPE Federal University of Rio de Janeiro (Rio de Janeiro, Brazil, Sept. 1990).
14. L.A. Hall and R.J. Vanderbei, "Two-thirds is sharp for affine scaling," Operations Research Letters 13 (1993) 197-201.
15. A.J. Hoffman, "On approximate solutions of systems of linear inequalities," Journal of Research of the National Bureau of Standards 49 (1952) 263-265.
16. N.K. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica 4 (1984) 373-395.
17. N. Megiddo and M. Shub, "Boundary behavior of interior point algorithms in linear programming," Mathematics of Operations Research 14 (1989) 97-114.
18. S. Mehrotra, "Quadratic convergence in a primal-dual method," Mathematics of Operations Research 18 (1993) 741-751.
19. C.L. Monma and A.J. Morton, "Computational experience with the dual affine variant of Karmarkar's method for linear programming," Operations Research Letters 6 (1987) 261-267.
20. R.D.C. Monteiro and T. Tsuchiya and Y. Wang, "A simplified global convergence proof of the affine scaling algorithm," Annals of Operations Research 47 (1993) 443-482.
21. M. Muramatsu and T. Tsuchiya, "Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm," Mathematical Programming 72 (1996) 291-305.
22. M.G.C. Resende and G. Veiga, "An efficient implementation of a network interior point method," in: D.S. Johnson and C.C. McGeoch, eds., Network Flows and Matching: First DIMACS Implementation Challenge, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 12 (American Mathematical Society, 1993) pp. 299-348.
23. L. Sinha and B. Freedman and N. Karmarkar and A. Putcha and K. Ramakrishnan, "Overseas network planning," Proc. Third Internat. Network Planning Sysmposium - Networks'86 (IEEE Communications Society, held on June 1-6, 1986, Tarpon Springs, FL, 1986) 121-124.
24. M. Todd, "A low complexity interior-point algorithm for linear programming," SIAM Journal on Optimization 2 (1992) 198-209.
25. M. Todd and J.-P. Vial, "Todd's complexity interior-point algorithm is a predictor-corrector path-following algorithm," Operations Research Letters 11 (1992) 199-207.
26. P. Tseng and Z.Q. Luo, "On the convergence of the affine-scaling algorithm," Mathematical Programming 56 (1992) 301-319.
27. T. Tsuchiya, "Global convergence of the affine-scaling methods for degenerate linear programming problems," Mathematical Programming 52 (1991) 377-404.
28. T. Tsuchiya, "Quadratic convergence of In and Imai's method for degenerate linear programming problems," Jounral of Optimization Theory and Applications 87 (3) (1995) 703-726.
29. T. Tsuchiya, "Global convergence property of the affine scaling method for primal degenerate linear programming problems," Mathematics of Operations Research 17 (3) (1992) 527-557.
30. T. Tsuchiya and M. Muramatsu, "Global convergence of a long-step affine scaling algorithm for degenerate linear programming problems," SIAM Journal on Optimization 5(3) (1995) 525-551.
31. R.J. Vanderbei and J.C. Lagarias, "I.I. Dikin's convergence result for the affine-scaling algorithm," Contemporary Mathematics 114 (1990) 109-119.
32. R.J. Vanderbei, M.S. Meketon and B.A. Freedman, "A modification of Karmarkar's linear programming algorithm," Algorithmica 1 (4) (1986) 395-407.
33. C. Witzgall, P.T. Boggs and P.D. Domich, "On the convergence behavior of trajectories for linear programming," Contemporary Mathematics 114 (1990) 109-119.
34. Y. Ye, O. Güler, R.A. Tapia and Y. Zhang, "A quadratically convergent O( √nL)-iteration algorithm for linear programming," Mathematical Programm ing 59 (1993) 151-162.