J4

• 数学 • 上一篇    下一篇

求解非线性规划的原始对偶内点法

张 珊1, 姜志侠1,2, 刘元慧3   

  1. 1. 吉林大学 数学研究所, 长春 130012; 2. 长春理工大学 应用数学系, 长春 130022;3. 燕山大学 理学院, 河北省 秦皇岛 066004
  • 收稿日期:2006-11-21 修回日期:1900-01-01 出版日期:2007-09-26 发布日期:2007-09-26
  • 通讯作者: 张 珊

Primaldual Point Method for Nonlinear Programming

ZHANG Shan1, JIANG Zhixia1,2, LIU Yuanhui3   

  1. 1. Institute of Mathematics, Jilin University, Changchun 130012, China; 2. Department of Applied Mathematics, Changchun University of Science and Technology, Changchun 130022, China; 3. College of Sciences, Yanshan University, Qinhuangdao 066004, Hebei Province, China
  • Received:2006-11-21 Revised:1900-01-01 Online:2007-09-26 Published:2007-09-26
  • Contact: ZHANG Shan

摘要: 应用一个指数障碍函数和原始对偶内点法求解一个非线性规划问题, 并利用线性搜索方法建立了全局收敛性定理.

关键词: 原始对偶内点法, 原始对偶指数障碍惩罚函数, 全局收敛性, 非线性规划

Abstract: An exponent barrier penalty function and a primaldual interior point method were applied to solving nonlinear programming problems. Furthermore, a global convergence theory was established via the framework of line search methods.

Key words: primaldual interior point method, primaldual expo nent barrier penalty function, global convergence, nonlinear programming

中图分类号: 

  • O221.2