A new rectangle branch-and-pruning approach for generalized geometric programming
From MaRDI portal
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
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- 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.
- Prediction of oligopeptide conformations via deterministic global optimization
- The expansion of functions under transformation and its application to optimization
Cited in
(26)- Signomial and polynomial optimization via relative entropy and partial dualization
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Global optimization for generalized geometric programming problems with discrete variables
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- An effective global optimization algorithm for quadratic programs with quadratic constraints
- An effective algorithm for globally solving quadratic programs using parametric linearization technique
- A global interior point method for nonconvex geometric programming
- Range division and contraction algorithm for a class of global optimization problems
- A new accelerating method for globally solving a class of nonconvex programming problems
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- A parametric linearizing approach for quadratically inequality constrained quadratic programs
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- A new global optimization algorithm for solving generalized geometric programming
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- A robust algorithm for generalized geometric programming
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
- A global optimization algorithm for signomial geometric programming problem
- A nonisolated optimal solution for special reverse convex programming problems
- 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
- Using conical partition to globally maximizing the nonlinear sum of ratios
- Branch-reduction-bound algorithm for generalized geometric programming
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- Global optimization for generalized linear multiplicative programming using convex relaxation
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)