首页 | 本学科首页   官方微博 | 高级检索  
     检索      

混合约束下广义几何规划的一种全局收敛算法
引用本文:张可村,王燕军.混合约束下广义几何规划的一种全局收敛算法[J].计算数学,2002,24(1):83-90.
作者姓名:张可村  王燕军
作者单位:西安交通大学理学院,西安,710049
摘    要:In this paper, we develop a rapidly convergent algorithm for mixed constrained signomial geometric programming. The algorithm makes use of the characteristics of signomial geometric programming, and establishes a new active-set strategy on the basis of trust region method. The global convergence is proved, and some numerical tests are given to illustrate the effectiveness.

关 键 词:广义几何规划  有效集策略  信赖域  全局收敛算法  混合约束
修稿时间:2000年3月26日

A GLOBAL CONVERGENT ALGORITHM FOR MIXED CONSTRAINED SIGNOMIAL GEOMETRIC PROGRAMMING
Institution:Zhang Kecun Wang Yanjun (School of Science, Xi'an Jiaotong University, Xi'an, 710049)
Abstract:In this paper, we develop a rapidly convergent algorithm for mixed constrained signomial geometric programming. The algorithm makes use of the characteristics of signomial geometric programming, and establishes a new active-set strategy on the basis of trust region method. The global convergence is proved, and some numerical tests are given to illustrate the effectiveness.
Keywords:signomial geometric programming  active-set strategy  trust region
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算数学》浏览原始摘要信息
点击此处可从《计算数学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号