Accelerating method of global optimization for signomial geometric programming

Authors:
Pei-Ping Shen;Xiao-ai Li;Hong-Wei Jiao
Affiliations:
College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, PR China;College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, PR China;Department of Mathematics, Henan Institute of Science and Technology, Xinxiang 453003, PR China
Venue:
Journal of Computational and Applied Mathematics
Year:
2008

Citing 4
Cited 1

Deterministic global optimization with partition sets whose feasibility is not known: application to concave minimization reverse convex

Journal of Optimization Theory and Applications
An infeasible interior-point algorithm for solving primal and dual geometric programs

Mathematical Programming: Series A and B - Special issue: interior point methods in theory and practice
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming

Mathematical and Computer Modelling: An International Journal

A nonisolated optimal solution for special reverse convex programming problems

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	7.29

Visualization

Abstract

Signomial geometric programming (SGP) has been an interesting problem for many authors recently. Many methods have been provided for finding locally optimal solutions of SGP, but little progress has been made for global optimization of SGP. In this paper we propose a new accelerating method for global optimization algorithm of SGP using a suitable deleting technique. This technique offers a possibility to cut away a large part of the currently investigated region in which the globally optimal solution of SGP does not exist, and can be seen as an accelerating device for global optimization algorithm of SGP problem. Compared with the method of Shen and Zhang [Global optimization of signomial geometric programming using linear relaxation, Appl. Math. Comput. 150 (2004) 99-114], numerical results show that the computational efficiency is improved obviously by using this new technique in the number of iterations, the required saving list length and the execution time of the algorithm.