J4 ›› 2011, Vol. 49 ›› Issue (06): 1044-1052.

Previous Articles     Next Articles

Aggregate Homotopy InteriorPoint Method forGeneral Nonlinear Programming Problems

JIN Jianlu, TAN Jiawei, HE Li, LIU Qinghuai   

  1. School of Basic Science, Changchun University of Technology, Changchun 130012, China
  • Received:2011-03-04 Online:2011-11-26 Published:2011-11-28
  • Contact: LIU Qinghuai E-mail:liuqh6195@126.com

Abstract:

We studied the problems of general nonlinear programming with equality constrains. First, the inequality constrain was expressed as an nonsmooth inequality constrain by means of the maxvalue function, then with aggregate technique this constrain was smoothed. With the help of combined homotopy interiorpoint method and the weak normal condition, the existence of solution of the generalized K-K-T equation was verified. The algorithm was proved to be globally convergent. The results of numerical experiments show that the algorithm is effective and convenient.

Key words:  nonlinear programming; aggregate function; homotopy method

CLC Number: 

  • O221.2