吉林大学学报(工学版) ›› 2000, Vol. 30 ›› Issue (01): 53-56.

• paper • Previous Articles     Next Articles

A Weaker Condition of Combined Homotopy Interior Point Method for Solving Nonlinear Convex Programming

CHI Ya-jing, CHU Ming   

  1. College of Sciences, Jilin University of Technology, Changchun 130025, China
  • Received:1999-03-16 Online:2000-01-25 Published:2000-01-25

PDF (PC)

330

Abstract:

The problem for getting K-T point of nonlinear programming by combined homotopy interior point method under linearly independent constraint qualification is discussed at [1].This paper has proved that the conclusion at [1] is held without the condition of linearly independent when feasible field is a convex.

Key words: nonlinear programming, combined homotopy interior point method, K-T point, constraint qualification

CLC Number: 

  • O221


[1] Feng G C, Lin Z H, Yu B. Existence of an interidr pathway to a Kurush-Kuhn-Tucker point of a nonconvex programming problem
[J]. Nonlinear Analaysis, Theory, Methods & Applications, 1998, 32(6): 761-768.

[2] Wang Y, Feng G C, Lin Z H. Interior point algrithm for convex nonlinear programming problems
[J]. Numerical Mathematics, J. Chinese Universities, 1992, I(1): 1-8.

[3] 迟雅敬,董加礼,刘庆怀.解非线性凸规划问题的组合同伦内点法的推广
[J].华中师范大学学报(专辑), 1998.
[1] CHEN Peng|YAN Xin-ping|LI Xu-hong|WU Chao-zhong. Schedule coordination model between rail transit and bus transit [J]. 吉林大学学报(工学版), 2011, 41(4): 950-955.
[2] MA Fei,WU Meng-na,SUN Bao-feng,YANG Hua. Modeling and simulation of supply chain scheduling in mass customization [J]. 吉林大学学报(工学版), 2009, 39(增刊2): 337-0340.
[3] CHI Ya-jing, CHU Ming. Extension of an Interior Point Method for Nonconvex Programming [J]. 吉林大学学报(工学版), 2000, (3): 68-71.
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