吉林大学学报(工学版) ›› 2000, Vol. ›› Issue (3): 68-71.

Previous Articles     Next Articles

Extension of an Interior Point Method for Nonconvex Programming

CHI Ya-jing, CHU Ming   

  1. College of Sciences, Jilin University of Technology, Changchun 130025, China
  • Received:1999-09-23 Online:2000-07-25

PDF (PC)

188

Abstract: An interior point method for getting the K T point of a nonlinear programming under linear independent constraint qualifications is given at[1].The problem for getting K T point under the Cottle constraint qualifications is solved in this paper.

Key words: nonconvex programming, homotopy method, interior point method, constraint qualifications

CLC Number: 

  • O22
[1] Huang Chunyi,Yu Bo,Wang Yu.A new interior path following method for nonconvex nonlinear programming［J］,Northeast.Math.J.1997,13(3):257～260.
[2] 王字.计算优化同伦算法［M］.大连:大连海事大学出版社,1996.
[3] 李兴斯.解非线性规划的凝聚函数法［J］.中国科学(A辑),1991,12:1 283～1 288.
[4] Feng G C,Lin Z H,Yu B.Existence of an interior pathway to a karush-kuhn-tuckor point of a nonconvex programming problem［J］.Nonlinear Analysis,Theory,Mathods & Applications,1998,32(6):761～768.
[1] LI Hong-wei, LIU Pei-jun, LIU Qing-huai . Homotopy Interior Point Method and Its Computer Realization for Non-convex & Non-smooth Optimization [J]. 吉林大学学报(工学版), 2001, (4): 49-53.
[2] CHI Ya-jing, CHU Ming . A Weaker Condition of Combined Homotopy Interior Point Method for Solving Nonlinear Convex Programming [J]. 吉林大学学报(工学版), 2000, 30(01): 53-56.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright © Journal of Jilin University(Engineering and Technology Edition), All Rights Reserved.
Tel: +86-431-85095297　Fax: +86-431-85094074　E-mail: xbgxb@jlu.edu.cn
Powered by Beijing Magtech Co. Ltd