A global optimization algorithm for signomial geometric programming problem

DOI10.1155/2014/163263zbMath1470.90092OpenAlexW1997160194WikidataQ59035640 ScholiaQ59035640MaRDI QIDQ1722230

Yong-Qiang Chen, Pei-Ping Shen, Xue-Ping Hou

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/163263

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (3)

Fuzzy geometric programming approach in multivariate stratified sample surveys under two stage randomized response model ⋮ A novel optimization method for nonconvex quadratically constrained quadratic programs ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
• A new rectangle branch-and-pruning approach for generalized geometric programming
• A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
• A new accelerating method for globally solving a class of nonconvex programming problems
• A robust algorithm for generalized geometric programming
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• Reduction of indefinite quadratic programs to bilinear programs
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• Comparison of generalized geometric programming algorithms
• Generalized geometric programming applied to problems of optimal control. I: Theory
• An infeasible interior-point algorithm for solving primal and dual geometric programs
• Global optimization of nonconvex polynomial programming problems having rational exponents
• Global optimization of signomial geometric programming using linear relaxation.
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• The expansion of functions under transformation and its application to optimization
• A global optimization using linear relaxation for generalized geometric programming
• Geometric programming with signomials
• A deterministic global optimization algorithm for generalized geometric programming
• Geometric Programming: Methods, Computations and Applications
• Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
• Generalized Polynomial Optimization
• Duality Theory for Geometric Programming
• Generalized Weighted Mean Programming
• Introduction to global optimization.

This page was built for publication: A global optimization algorithm for signomial geometric programming problem