A combined homotopy interior point method for general nonlinear programming problems

Applied Mathematics and Computation

Volumn 80, Issue 2-3, 1996, Pages 209-224

  Zhenghua, Lin ^a   Yong, Li ^a   Bo, Yu ^a  

^a JILIN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0007512847     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/0096-3003(95)00295-2     Document Type: Article

References (21)

1. R. B. Kellogg, T. Y. Li, and J. A. Yorke, A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results, SIAM J. Numerical Analysis. 18:473-483 (1976).
2. S. Smale, A Convergent Process of Price Adjustment and Global Newton Method, J. Math. Econ. 3:1-14 (1976).
3. S. N. Chow, J. Mallet-Paret, and J. A. Yorke, Finding Zeros of Maps: Homotopy Methods that are Constructive with Probability One, Math. Comput. 32:887-899 (1978).
4. E. L. Allgower and K. Georg, Numerical Continuation Methods: An Introduction, Springer-Vergal, Berlin, New York, 1990.
5. C. B. Garcia and W. I. Zangwill, Pathways to Solutions, Fixed Points and Equilibria, Prentice-Hall, Englewood Cliffs, N.J., 1981.
6. N. Megiddo, Pathways to the optimal set in linear programming, in Progress in Mathematical Programming, Interior Point and Related Methods, (N. Megiddo, Ed.), Springer, New York, 1988, pp. 131-158.
7. 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, New York, 1988, pp. 29-47.
8. N. Karmarkar, A New Polynomial-time Algorithm for Linear Programming, Combinatorica. 4:373-395 (1984).
9. I. Adler, M. G. C. Resende, G. Veiga, and N. Karmarkar, An Impelementation of Karmarkar's Algorithm for Linear Programming Problems, Mathematical Programming 44:297-335 (1989).
10. R. D. C. Monteiro and I. Adler, Interior Path Following Primal-Dual Algorithms. Part I: Linear Programming, Mathematical Programming. 44:27-41 (1989).
11. R. D. C. Monteiro and I. Adler, Interior Path Following Primal-Dual Algorithms. Part II: Convex Quadratical Programming, Mathematical Programming. 44:43-66 (1989).
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. J. Zhu, A Path-Following Algorithm for a Class of Convex Programming Problems, ZOR-Methods and Models of Operations Research. 86:359-377 (1992).
15. Y. Wang, G. C. Feng, and T. Z. Liu, Interior Point Algorithm for Convex Nonlinear Programming Problems, Numerical Mathematics, J. Chinese Universities 1(1) (1992).
16. 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, pp. 866-876.
17. G. Sonnevend and Stoer, Global Ellipsoidal Approximation and Homotopy Methods for Solving Convex Analytic Programming, Appl. Math. Optim. 21:139-165 (1990).
18. 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).
19. F. Jarre, Interior-Point Methods for Convex Programming, Applied Mathematics and Optimization. 26:287-311 (1992).
20. Z. Lin, B. Yu, and G. Feng, A Combined Homotopy Interior Point Method for Convex Programming Problems, Applied Mathematics and Computation, to appear.
21. G. L. Naber, Topological Methods in Euclidean Space, Cambridge University Press, London, 1980.