数学季刊 ›› 2011, Vol. 26 ›› Issue (2): 285-289.
摘要: 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.
中图分类号: