河南理工大学学报（自然科学版）2011，Vol.30Issue(1)：104-107,4.
无约束广义几何规划的一种具有全局收敛性的线性松弛方法
A new linear relaxation method with global convengence for unconstrained generalized geometric programming
摘要
Abstract
Geometric programming is a type of nonlinear programming problem that has a special form. Generalized geometric programming is a special DC programming whose solution is very difficult. This paper by using linearization technique converts generalized geometric programming into a sequence of convex programming programming, and proposes a new algorithm for unconstrained generalized geometric programming. The goble convergence can be attained.关键词
几何规划/凸函数/凸规划/最优解Key words
geometric programming/ convex function/ convex programming/ optimization solution分类
数理科学引用本文复制引用
景书杰,韩学锋..无约束广义几何规划的一种具有全局收敛性的线性松弛方法[J].河南理工大学学报（自然科学版）,2011,30(1):104-107,4.基金项目
国家自然科学基金资助项目(10671057) （10671057）
