A new rectangle branch-and-pruning approach for generalized geometric programming

DOI10.1016/j.amc.2006.05.137zbMath1112.65058OpenAlexW2033292398MaRDI QIDQ865546

Pei-Ping Shen, Hong-Wei Jiao

Publication date: 19 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.137

zbMATH Keywords

global optimizationbranch-and-boundmathematical programminglinear relaxationpruning technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (21)

Signomial and polynomial optimization via relative entropy and partial dualization ⋮ Range division and contraction algorithm for a class of global optimization problems ⋮ A parametric linearizing approach for quadratically inequality constrained quadratic programs ⋮ Branch-reduction-bound algorithm for generalized geometric programming ⋮ Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs ⋮ An accelerating outer space algorithm for globally solving generalized linear multiplicative problems ⋮ A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming ⋮ Using conical partition to globally maximizing the nonlinear sum of ratios ⋮ A new accelerating method for globally solving a class of nonconvex programming problems ⋮ Global optimization for generalized linear multiplicative programming using convex relaxation ⋮ A global optimization algorithm for signomial geometric programming problem ⋮ A global optimization approach for solving generalized nonlinear multiplicative programming problem ⋮ A novel optimization method for nonconvex quadratically constrained quadratic programs ⋮ A robust algorithm for generalized geometric programming ⋮ An effective algorithm for globally solving quadratic programs using parametric linearization technique ⋮ A continuous strategy to solve a class of mixed optimization problems ⋮ The discrete ellipsoid covering problem: a discrete geometric programming approach ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints ⋮ A branch and bound algorithm for globally solving a class of nonconvex programming problems ⋮ A nonisolated optimal solution for special reverse convex programming problems ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints

Cites Work

• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• An infeasible interior-point algorithm for solving primal and dual geometric programs
• Prediction of oligopeptide conformations via deterministic global optimization
• Global optimization of signomial geometric programming using linear relaxation.
• The expansion of functions under transformation and its application to optimization
• Unnamed Item

This page was built for publication: A new rectangle branch-and-pruning approach for generalized geometric programming