无约束正定几何规划的一种优化算法

An Algorithm in Positive Define Geometric Programming with Unconstraints

对正定几何规划充分利用几何规划的特殊性,在求解非线性等式约束的信赖域算法的启发下,建立了一种新的算法,并在相对弱的条件下,证明了这种算法的全局收敛性。

To the Positive define geometric programming,on the basis of making full use of the special characteristics of geometric programming, we establish a algorithm in the light of the thought of trust region algorithm with unlinear equality constraints,and under the weaker condition ,we prove that the algorithm possesses global convergence properties.