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

几何规划的简约共轭梯度算法
引用本文:曹香莲,景书杰,郑淑贞. 几何规划的简约共轭梯度算法[J]. 济南大学学报(自然科学版), 2009, 23(1)
作者姓名:曹香莲  景书杰  郑淑贞
作者单位:河南理工大学,数学与信息科学学院,河南,焦作,454003;河南理工大学,数学与信息科学学院,河南,焦作,454003;河南理工大学,数学与信息科学学院,河南,焦作,454003
摘    要:利用对偶理论将正定式几何规划转化为带有非负约束和线性等式约束下的非线性凸规划,并且将简约梯度算法与共轭梯度算法恰当结合,应用于求解约束正定式几何规划的对偶问题,构造出了求解几何规划的一个有效算法,并在Armijo步长搜索和适当的条件下证明了该算法的收敛性.

关 键 词:正定式几何规划  对偶规划  简约梯度法  共轭梯度法

Reduced Conjugate Gradient Algorithm for Geometric Program
CAO Xiang-lian,JING Shu-jie,ZHENG Shu-zhen. Reduced Conjugate Gradient Algorithm for Geometric Program[J]. Journal of Jinan University(Science & Technology), 2009, 23(1)
Authors:CAO Xiang-lian  JING Shu-jie  ZHENG Shu-zhen
Affiliation:School of Mathematics and Information Science;Henan Polytechnic University;Jiaozuo 454003;China
Abstract:The posynomial geometric programming is transferred into a nolinear convex progamming with contraints of linear equality by duality principle.Integrating the reduced gradient algorithm with the conjugate gradient algorithm,we solve the dual problem of posynomial geometric program with con-straints and construct an effective algorithm for geometric programming.The convergent properties of the algorithm are discussed under Armijo step search and appropriate conditions.
Keywords:posynomial geometric programming  dual programming  reduced gradient method  conjugate gradient method  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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