A global optimization algorithm for signomial geometric programming problem
type: Item
instance of: scholarly article
title: A global optimization algorithm for signomial geometric programming problem
zbMATH Open document ID: 1470.90092
DOI: 10.1155/2014/163263
author: Xue-Ping Hou
author: Peiping Shen
author: Yongqiang Chen
published in: Abstract and Applied Analysis
publication date: 2019-02-14T00:00:00Z
review text: Summary: This paper presents a global optimization algorithm for solving the signomial geometric programming (SGP) problem. In the algorithm, by the straight forward algebraic manipulation of terms and by utilizing a transformation of variables, the initial nonconvex programming problem (SGP) is first converted into an equivalent monotonic optimization problem and then is reduced to a sequence of linear programming problems, based on the linearizing technique. To improve the computational efficiency of the algorithm, two range reduction operations are combined in the branch and bound procedure. The proposed algorithm is convergent to the global minimum of the (SGP) by means of the subsequent solutions of a series of relaxation linear programming problems. And finally, the numerical results are reported to vindicate the feasibility and effectiveness of the proposed method.
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7021841
Wikidata QID: Q59035640
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/163263
OpenAlex ID: W1997160194
cites work: Reduction of indefinite quadratic programs to bilinear programs
cites work: Q4113605
cites work: Generalized geometric programming applied to problems of optimal control. I: Theory
cites work: Geometric Programming: Methods, Computations and Applications
cites work: Q4833806
cites work: The expansion of functions under transformation and its application to optimization
cites work: Duality Theory for Geometric Programming
cites work: Q5557595
cites work: Geometric programming with signomials
cites work: Generalized Weighted Mean Programming
cites work: Generalized Polynomial Optimization
cites work: An infeasible interior-point algorithm for solving primal and dual geometric programs
cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems
cites work: Global optimization of nonconvex polynomial programming problems having rational exponents
cites work: Global optimization of signomial geometric programming using linear relaxation.
cites work: A robust algorithm for generalized geometric programming
cites work: A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
cites work: A global optimization using linear relaxation for generalized geometric programming
cites work: Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
cites work: Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
cites work: A new accelerating method for globally solving a class of nonconvex programming problems
cites work: Introduction to global optimization.
cites work: Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
cites work: A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
cites work: A deterministic global optimization algorithm for generalized geometric programming
cites work: A new rectangle branch-and-pruning approach for generalized geometric programming
cites work: Comparison of generalized geometric programming algorithms
description: scientific article; zbMATH DE number 7021841