In this paper, on the basis of making full use of the characteristics of signomial geometric programming without constraints, we establish a new algorithm in the light of the thought of trust region algorithm, and under the weaker condition, we prove that the algorithm possesses global and local quadratic convergence properties. Some numerical examples are given to demonstrate the feasibility of this algorithm.
展开▼
