The Combined Homotopy Methods for Optimizition under the Quasi-Normal Cone Condition

Article Preview

Abstract:

Non-convex programming problem is a hot problem in research field of optimization problems, since the interior point method is applied for solving programming problem. In this paper, we use the homotopy interior point method for solving a class of optimization problems by the existing theoretical results under quasi-norm cone condition. Contrary to this partial reverse convex constrained domain, we give the structure method of the quasi-norm cone condition, construct the combined homotopy method under quasi-norm cone condition and show some numerical examples

You might also be interested in these eBooks

Info:

Periodical:

Pages:

16-18

Citation:

Online since:

January 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Feng Guochen, Yu Bo. Combined Homotopy Interior Point Method for Nonlinear Programming Problems. Lecture Notes in Num. Appl. Anal, 1995, 14: 9-16.

Google Scholar

[2] McCormick G P. The Projective SUMT Method for Convex Programming. Mathermatics of Operations Research, 1989, 14: 203-223.

DOI: 10.1287/moor.14.2.203

Google Scholar

[3] LIU Qing-huai. A Combined Homotopy Inter-point for Solving Non-convex Programming [D]: [Ph D Thesis]. Changchun: Jilin University, (1996).

Google Scholar