J4

• 数学 • Previous Articles     Next Articles

Infeasible Interiorpoint-Homotopy Method for Non-convex Programming under Normal Cone Condition

YANG Yihua1, LV Xianrui1, LIU Qinghuai2   

  1. 1. College of Mathematics, Jilin Univeristy, Changchun 130012, China;2. Institute of Applied Mathematics, Changchun Industry University, Changchun 130012, China
  • Received:2006-10-27 Revised:1900-01-01 Online:2007-05-26 Published:2007-05-26
  • Contact: YANG Yihua

Abstract: We have proved that when the combined homotopy infeasible interiorpoint method (CHIIP) proposed by us is used to solve the KKT points of non-convex nonlinear programming problems, it can be converted to solve the KKT points of nonconvex nonlinear programming problems from the homo topic curves produced by tracking the homotopic equations when the feasible domain of non-convex nonlinear programming problems meet the normal cone condition and the method (CHIIP) is globally convergent.

Key words: homotopy method, combined homotopy infeasible interior point method, non-convex programming

CLC Number: 

  • O221