Accelerating method of global optimization for signomial geometric programming (Q2479370): Difference between revisions

Signomial geometric programming (SGP) arising from various engineering design and robust stability problems has been an interesting problem for many authors recently. Many methods have been presented for finding locally optimal solutions of SGP, but little progress has been made for global optimization of SGP. The main purpose of this paper is to provide an accelerating method for global optimization algorithm of SGP. Based on the paper by \textit{P. P. Shen} and \textit{K. C. Zhang} [Appl. Math. Comput., 150, 99--114 (2004; Zbl 1053.90112)], a new deleting technique is given, and this technique offers the possibility to cut away a large part of the currently investigated feasible region which does not contain the global minimum of SGP. By using this new deleting technique it is possible to improve largely the convergence of the algorithm by reducing currently the investigated feasible region. Numerical experiments show that the computational efficiency can be improved obviously using this new technique, that is, the number of iterations, the required saving list length and the execution time of the algorithm can be reduced significantly.