求解非线性规划的原始对偶内点法
下载全文
[全文大小:180 K]
张珊[1] 姜志侠[1,2] 刘元慧[3]
[1]吉林大学数学研究所,长春130012 [2]长春理工大学应用数学系,长春130022 [3]燕山大学理学院,河北省秦皇岛066004
摘 要:
应用一个指数障碍函数和原始对偶内点法求解一个非线性规划问题,并利用线性搜索方法建立了全局收敛性定理.[著者文摘]
关 键 词:

文章出处:
《吉林大学学报:理学版》-2007年45卷5期 -717-722页
Journal of Jilin University: Sci Ed
栏目信息:
分 类 号:
文献标识码:
A
文章编号:
1671-5489(2007)05-0717-06
[参考文献]
Primal-dual Point Method for Nonlinear Programming
ZHANG Shan, JIANG Zhi-xia, LIU Yuan-hui (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)
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 exponent barrier penalty function; global convergence ; nonlinear programming
收稿日期: 2006-11-21

更多评论>>文章评论
学术
















cqvip.com