摘要
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.
基金
Supported by the National Science Foundation of China（10671126）
Supported by the Shanghai Municipal Government Project（S30501）
Supported by the Innovation Fund Project for Graduate Student of Shanghai（JWCXSL1001）
Supported by the Youth Foundation of Henan Polytechnic University（Q20093）
Supported by the Applied Mathematics Provinciallevel Key Discipline of Henan Province
Supported by Operational Research and Control Theory Key Discipline of Henan Polytechnic University
