A combined homotopy interior point method for convex nonlinear programming

Applied Mathematics and Computation

Volumn 84, Issue 2-3, 1997, Pages 193-211

  Lin, Zhenghua ^a   Yu, Bo ^a   Feng, Guochen ^a  

^a JUIN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000624541     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-3003(96)00086-0     Document Type: Article

References (25)

1. I. Adler, R. D. C. Monteiro, G. Veiga, and N. Karmarkar, An implementation of Karmarkar's algorithm for linear programming problems, Mathematical Programming 44 297-335 (1989).
2. R. M. Freund, Theoretical efficiency of a shifted barrier function algorithm for linear programming, Linear Algebra and Its Applications 152 19-41 (1991).
3. P. E. Gill, W. Murray, M. A. Saunders, J. A. Tomlin, and W. H. Wright, On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method, Mathematical Programming 36 183-209 (1986).
4. J. Jarre, On the convergence of the method of analytic centers when applied to convex quadratic programs, Mathematical Programming 49 341-358 (1990/91).
5. N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 373-395 (1984).
6. M. Kojima, S. Mizuno, and A. Yoshise, A primal-dual interior point algorithm for linear programming. In: (N. Megiddo, Ed.), Progress in Mathematical programming, Interior Point and Related Methods, Springer, New York, 1988, 29-47.
7. N. Megiddo, Pathways to the optimal set in linear programming. In (N. Megiddo, Ed.), Progress in Mathematical Programming, Interior Point and Related Methods, Springer, New York, 1988, 131-158.
8. N. Megiddo, Eds., Progress in Mathematical programming, Interior Point and Related Methods, Springer-Verlag, New York, 1988.
9. R. D. C. Monteiro, and I. Adler, Interior path following primal-dual algorithms. Part I: Linear programming, Mathematical Programming 44 27-41 (1989);
10. R. D. C. Monteiro, and I. Adler, Interior path following primal-dual algorithms. Part II: convex quadratical programming. Mathematical Programming 44 43-66 (1989).
11. G. Sonnevend, An analytical centre for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Lecture Notes in Control and Inform. Sci. 84 (A. Prekopa, Ed.) Springer-Verlag, 1985, 866-876.
12. G. P. McCormick, The projective SUMT method for convex programming, Mathematics of Operations Research 14 203-223 (1989).
13. R. D. C. Monteiro, and I. Adler, An extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence, Mathematics of Operations Research 15 408-422 (1990).
14. G. Sonnevend, and Stoer, Global ellipsoidal approximation and homotopy methods for solving convex analytic programming, Appl. Math. Optim. 21 139-165 (1990).
15. K. O. Kortanek, F. Potra, and Y. Ye, On some efficient interior point algorithms for nonlinear convex programming, Linear Algebra and its Applications 152 169-189 (1991).
16. F. Jarre, Interior-point methods for convex programming, Applied Mathematics and Optimization 26 287-311 (1992).
17. Y. Wang, G. C. Feng, and T. Z. Liu, Interior point algorithm for convex nonlinear programming problems, Numerical Mathematics J. Chinese Universities 1(1) 1-8 (1992).
18. J. Zhu, A path following algorithm for a class of convex programming problems, ZOR-Methods and Models of Operations Research 36 359-377 (1992).
19. D. den Hertog, F. Jarre, C. Roos, and T. Terlaky, A unifying investigation of interior-point methods for convex programming, Technical Report 92-89, Faculty of Mathematics and Informatics, TU Delft, NL-2628 BL Delft, The Netherlands, 1992.
20. D. den Hertog, C. Roos, and T. Terlaky, A large-step analytic center method for a class of smooth convex programming problems, SIAM Journal of Optimization 2 55-70 (1992).
21. D. den Hertog, C. Roos, and T. Terlaky, On the classical logarithmic barrier function method for a class of smooth convex programming problems, Journal of Optimization Theory and Applications 73 1-25 (1992).
22. Y. E. Nesterov, and A. S. Nemirovsky, Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms, SIAM Publications, SIAM, Philadelphia, 1993.
23. C. B. Garcia, and W. I. Zangwill, Pathways to Solutions, Fixed Points and Equilibria, Prentice-Hall, Englewood Cliffs, N.J., 1981.
24. E. L. Allgower, and K. Georg, Numerical Continuation Methods: An Introduction, Springer-Verlag, Berlin, New York, 1990.
25. G. C. Feng, Z. Lin, and B. Yu, Existence of Interior Pathway to a Karush-Kuhn-Tucker Point of a Nonconvex Programming Problem, to appear.