吉林大学学报(工学版) ›› 2001, Vol. ›› Issue (4): 49-53.

Previous Articles     Next Articles

Homotopy Interior Point Method and Its Computer Realization for Non-convex & Non-smooth Optimization

LI Hong-wei1, LIU Pei-jun2, LIU Qing-huai 3   

  1. 1. College of Biological & Agricultural Enginering, Jilin University, Changchun 130025, China;
    2. Head-master Office, Changchun Institute of Optics & Fine Mechanics, Changchun 130021, China;
    3. College of Mathematics Science, Jiin University, Changchun 130025, China
  • Received:2001-03-15 Online:2001-10-25

Abstract: This paper mainly presents a homotopy interior point method and its computer realization for nonconvex and non-smooth programming that is abstracted from a kind of problems in green manufacturing practice. It is proved feasible by a numerical problem.

Key words: green manufacturing, non-convex optimization, non-smooth optimization, homotopy interior point method, computer realization

CLC Number: 

  • O221.2
[1] 刘庆怀.解非凸规划问题的组合同伦内点法[D].长春:吉林工业大学理学院,1999.
[2] 李洪伟.求解非凸非光滑优化问题的凝聚同伦内点法[D].长春:吉林大学数学科学学院,2001.
[3] Lin Z H, Yu B, Feng G C. A combined homotopy interior point method for convex programming problem[J]. Appl. Math.Comput, 1997, 84:193~211.
[4] Yang Yinsheng, Li Hongwei, Tong Jin. Green assessment of multi-product based on concordance analysis[A]. Proceedings of 2001 International Conference on Management Science & Engineering (Volume Ⅱ)[C]. Harbin, P. R. China, 2001.
[1] ZHU Yong-gui, LIU Ping, CONG Jia. Splitting method to solve Lp problem in sparse image reconstruction [J]. 吉林大学学报(工学版), 2013, 43(增刊1): 55-59.
[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!