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

DOI10.1016/J.AMC.2006.05.137MaRDI QIDQ865546zbMATH OpenOpenAlexFDO

Authors Peiping 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

branch-and-boundglobal optimizationlinear relaxationmathematical programmingpruning technique

Mathematics Subject Classification ID

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

Recommendations

• A new global optimization algorithm for solving generalized geometric programming
• A new global optimization algorithm for solving generalized geometric programming
• Global optimization of generalized geometric programming
• Algorithm of global optimization for generalized geometric programming
• A deterministic global optimization algorithm for generalized geometric programming

Cites work

• An infeasible interior-point algorithm for solving primal and dual geometric programs
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• Global optimization of signomial geometric programming using linear relaxation.
• scientific article; zbMATH DE number 757677 (Why is no real title available?)
• Prediction of oligopeptide conformations via deterministic global optimization
• The expansion of functions under transformation and its application to optimization

Cited in

(27)

• A parametric linearizing approach for quadratically inequality constrained quadratic programs
• 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
• An effective algorithm for globally solving quadratic programs using parametric linearization technique
• Using conical partition to globally maximizing the nonlinear sum of ratios
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• An effective global optimization algorithm for quadratic programs with quadratic constraints
• Branch-reduction-bound algorithm for generalized geometric programming
• Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• A nonisolated optimal solution for special reverse convex programming problems
• Range division and contraction algorithm for a class of global optimization problems
• Global optimization for generalized geometric programming problems with discrete variables
• A new global optimization algorithm for solving generalized geometric programming
• A continuous strategy to solve a class of mixed optimization problems
• The discrete ellipsoid covering problem: a discrete geometric programming approach
• An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
• A new global optimization algorithm for solving generalized geometric programming
• A global interior point method for nonconvex geometric programming
• An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
• A spatial global optimization algorithm for generalized fractional programming problems using second-order cone relaxation
• Signomial and polynomial optimization via relative entropy and partial dualization
• A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
• A new accelerating method for globally solving a class of nonconvex programming problems
• A robust algorithm for generalized geometric programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865546)