Global optimization of signomial geometric programming using linear relaxation.

DOI10.1016/S0096-3003(03)00200-5zbMath1053.90112MaRDI QIDQ1428180

Pei-Ping Shen, Ke-Cun Zhang

Publication date: 14 March 2004

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

SGPGlobal optimizationBranch and boundLinear relaxation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items (33)

A Continuous Strategy to Solve a Class of Discrete Optimization Problems ⋮ Signomial and polynomial optimization via relative entropy and partial dualization ⋮ Range division and contraction algorithm for a class of global optimization problems ⋮ Solving generalized polynomial problem by using new affine relaxed technique ⋮ On generalized geometric programming problems with non-positive variables ⋮ Branch-reduction-bound algorithm for generalized geometric programming ⋮ Global optimization of generalized linear fractional programming with nonlinear constraints ⋮ A new rectangle branch-and-pruning approach for generalized geometric programming ⋮ Global optimization of bilinear programs with a multiparametric disaggregation technique ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ A new global optimization algorithm for solving generalized geometric programming ⋮ Multi-parametric disaggregation technique for global optimization of polynomial programming problems ⋮ A global optimization using linear relaxation for generalized geometric programming ⋮ A new bound-and-reduce approach of nonconvex quadratic programming problems ⋮ A new hybrid method for solving global optimization problem ⋮ An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming ⋮ Using conical partition to globally maximizing the nonlinear sum of ratios ⋮ Global minimization for generalized polynomial fractional program ⋮ A global optimization algorithm for signomial geometric programming problem ⋮ A robust algorithm for generalized geometric programming ⋮ A continuous strategy to solve a class of mixed optimization problems ⋮ The discrete ellipsoid covering problem: a discrete geometric programming approach ⋮ Global optimization for sum of generalized fractional functions ⋮ Accelerating method of global optimization for signomial geometric programming ⋮ Global optimization for sum of geometric fractional functions ⋮ A global optimization algorithm using linear relaxation ⋮ Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints ⋮ A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems ⋮ An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications ⋮ A nonisolated optimal solution for special reverse convex programming problems ⋮ Inner approximation algorithm for generalized linear multiplicative programming problems ⋮ Global optimization for generalized geometric programming problems with discrete variables

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Prediction of oligopeptide conformations via deterministic global optimization
• Global optimization of nonconvex polynomial programming problems having rational exponents
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• The expansion of functions under transformation and its application to optimization
• Geometric Programming: Methods, Computations and Applications
• Generalized Polynomial Optimization
• Generalized Weighted Mean Programming

This page was built for publication: Global optimization of signomial geometric programming using linear relaxation.