On the relationship between the curvature integral and the complexity of path-following methods in linear programming

SIAM Journal on Optimization

Volumn 6, Issue 1, 1996, Pages 57-73

  Zhao, Gongyun ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Bounds of derivatives; Central trajectory (path); Complexity; Curvature integral; Derivatives; Linear programming; Path following methods

Indexed keywords

EID: 0030304770     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/0806005     Document Type: Article

References (15)

1. D. A. BAYER AND J. C. LAGRIAS, The nonlinear geometry of linear programming, I, II, III, Trans. Amer. Math. Soc., 314 (1989), pp. 499-526, 527-581 and 320 (1990), pp. 193-225.
2. D. A. BAYER AND J. C. LAGRIAS, The nonlinear geometry of linear programming, I, II, III, Trans. Amer. Math. Soc., 314 (1989), pp. 499-526, 527-581 and 320 (1990), pp. 193-225.
3. FL. JARRE, The method of analytic centers for smooth convex programs, Ph.D. thesis, Universität Würzburg, Grottenthaler Verlag, Bamberg, Germany, 1989.
4. N. KARMARKAR, A new polynomial time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
5. _, Riemannian geometry underlying interior-point methods for linear programming, in Mathematical Developments Arising from Linear Programming, J. C. Lagarias and M. Todd, eds., Contemporary Mathematics, Vol. 114, American Mathematical Society, Providence, RI, 1990, pp. 51-76.
6. M. KOJIMA, N. MEGIDDO, T. NOMA, AND A. YOSHISE, A unified approach to interior point algorithms for linear complementarity problems, Research report RJ 7493 (70008), IBM Almaden Research Division, San Jose, CA, 1990.
7. S. MIZUNO, M. J. TODD, AND Y. YE, Anticipated behavior of path-following algorithm for linear programming, Tech. Report No. 878, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1989.
8. _, On adaptive-step primal-dual interior-point algorithm for linear programming, Tech. Report No. 944, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1990. Math. Oper. Res., to appear.
9. C. ROOS AND I.-PH. VIAL, A polynomial method of approximate weighted centers for linear programming, Tech. Report 89-13, Techn. Univ. Delft, Delft, the Netherlands, 1988.
10. G. SONNEVEND, An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, Lecture Notes in Control and Information Sciences, Vol. 84, Springer-Verlag, 1985, pp. 866-876.
11. G. SONNEVEND, J. STOER, AND G. ZHAO, On the complexity of following the central path of linear programs by linear extrapolation II, Math. Programming, 52 (1991), pp. 527-553.
12. M. TODD, Recent developments and new directions in linear programming, Mathematical Programming - Recent Developments and Applications, M. Iri and K. Tanabe, eds., Kluwer Academic Publishers, Boston, 1989, pp. 109-157.
13. C. WITZGALL, P. T. BOGGS, AND P. D. DOMICH, On the convergence behavior of trajectories for linear programming, in Mathematical Developments Arising from Linear Programming Algorithms, J. C. Lagarias and M. J. Todd, eds., Contemporary Mathematics, Vol. 114, American Mathematical Society, Providence, RI, 1991, pp. 161-187.
14. Y. YE, O. GÜLER, R. A. TAPIA, AND Y. ZHANG, A quadratically convergent O(√nL)-iteration algorithm for linear programming, Working Paper No. 91-14, College of Business Administration, The University of Iowa, Iowa City, 1991.
15. G. ZHAO AND J. STOER, Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals, Appl. Math. Optimization, 27 (1993), pp. 85-103.