在这份报纸,根据充分利用非强迫的概括几何编程(GGP ) 的特征,我们为解决非强迫的 GGP 问题经由 conjugate 路径建立一个非单调的信任区域算法。冷凝作用问题的一种新类型被介绍,然后详细规格结合路径为这个问题,我们由非单调的信任区域算法沿着得到这个问题的近似答案被构造,并且进一步证明算法有全球集中和二次的集中性质。
In this paper,on the basis of making full use of the characteristics of unconstrained generalized geometric programming(GGP),we establish a nonmonotonic trust region algorithm via the conjugate path for solving unconstrained GGP problem.A new type of condensation problem is presented,then a particular conjugate path is constructed for the problem,along which we get the approximate solution of the problem by nonmonotonic trust region algorithm,and further prove that the algorithm has global convergence and quadratic convergence properties.