An asymptotical O(√nL)-iteration path-following linear programming algorithm that uses wide neighborhoods

SIAM Journal on Optimization

Volumn 6, Issue 3, 1996, Pages 570-586

  Hung, Pi Fang ^a   Ye, Yinyu ^b  

^a TUNGHAI UNIVERSITY   (Taiwan)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Central path; Complexity; Interior point algorithm; Linear programming

Indexed keywords

EID: 0030209175     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494266869     Document Type: Article

References (27)

1. 3L) algorithm for linear programming, Math. Programming, 54 (1992), pp. 251-267.
2. D. A. BAYER AND J. C. LAGARIAS, The nonlinear geometry of linear programming: I. Affine and projective scaling trajectories, II. Legendre transform coordinates and central trajectories, Trans. Amer. Math. Soc., 314 (1989), pp. 499-581.
3. T. J. CARPENTER. I. J. LUSTIG, J. M. MULVEY, AND D. F. SHANNO, Higher-order predictor-corrector interior point methods with application to quadratic objectives, SIAM J. Optim., 3 (1993), pp. 696-725.
4. A. J. GOLDMAN AND A. W. TUCKER, Polyhedral convex cones, in Linear Inequalities and Related Systems, H. W. Kuhn and A. W. Tucker, eds., Princeton University Press, Princeton, NJ, 1956, pp. 19-40.
5. 3L) operations, in Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, 1988, pp. 1-28.
6. O. GÜLER AND Y. YE, Convergence behavior of interior-point algorithms, Math. Programming, 60 (1993), pp. 215-228.
7. N. KARMARKAR, A new polynomial-time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
8. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A primal-dual interior point algorithm for linear programming, in Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, 1988, pp. 29-47.
9. _, A polynomial-time algorithm for a class of linear complementarity problems, Math. Programming, 44 (1989), pp. 1-26.
10. I. J. LUSTIG, R. E. MARSTEN, AND D. F. SHANNO, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra Appl., 152 (1991), pp. 191-222.
11. N. MEGIDDO, Pathways to the optimal set in linear programming, in Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, 1988, pp. 131-158.
12. S. MEHROTRA, On the implementation of a (primal-dual) interior point method, SIAM J. Optim., 2 (1992), pp. 575-601.
13. R. C. MONTEIRO AND I. ADLER, Interior path following primal-dual algorithms. Part I: Linear programming, Math. Programming, 44 (1989), pp. 27-42.
14. R. C. MONTEIRO, I. ADLER, AND M. G. C. RESENDE, A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension, Math. Oper. Res., 15 (1990), pp. 191-214.
15. S. MIZUNO, M. J. TODD, AND Y. YE, On adaptive-step primal-dual interior-point algorithms for linear programming, Math. Oper. Res., 18 (1993), pp. 964-981.
16. _, A surface of analytic centers and infeasible-interior-point algorithms for linear programming, Math. Oper. Res., 20 (1995), pp. 135-162.
17. YU. NESTEROV, Long steps strategies in interior-point potential reduction methods, Working paper, Central Economical and Mathematical Institute, Russian Academy of Science, Moscow, Russia, 1993.
18. V. PAN, Complexity of computations with matrices and polynomials, SIAM Rev., 34 (1992), pp. 225-262.
19. F. A. POTRA, A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points, Math. Programming, 67 (1994), pp. 383-406.
20. C. ROOS AND J -PH. VIAL, Long steps with the logarithmic penalty barrier function in linear programming, in Economic Decision-Making: Games, Econometrics & Optimization, J. Gabszeywicz, J. F. Richard, and L. Wolsey, eds., Elsevier Science Publisher B. V., Amsterdam, 1989, pp. 433-441.
21. J. RENEGAR, A polynomial-time algorithm based on Newton's method for linear programming, Math. Programming, 40 (1988), pp. 59-94.
22. G. SONNEVEND, An analytical center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in Lecture Notes in Control and Information Sciences, Vol. 84, Springer-Verlag, New York, 1985, pp. 866-876.
23. R. A. TAPIA, Y. ZHANG, M. SALTZMAN, AND A. WEISER, The Predictor-Corrector Interior-Point Method as a Composite Newton Method, Tech. report TR 90-17, Department of Mathematical Sciences, Rice University, Houston, TX, 1990.
24. X. XU AND Y. YE, A Generalized Homogeneous and Self-Dual Linear Programming Algorithm, Working paper, College of Business Administration, The University of Iowa, Iowa City, IA, 1993.
25. X. XU, P.-F. HUNG, AND Y. YE, A Simplified Homogeneous and Self-Dual Linear Programming Algorithm and its Implementation, Working paper, College of Business Administration, The University of Iowa, Iowa City, IA, 1993.
26. Y. YE, M. J. TODD, AND S. MIZUNO, An O(√nL)-iteration homogeneous and self-dual linear programming algorithm, Math. Oper. Res., 19 (1994), pp. 53-67.
27. Y. ZHANG AND D. ZHANG, On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms, Math. Programming, 68 (1995), pp. 303-318.