Branch-reduction-bound algorithm for generalized geometric programming
From MaRDI portal
Publication:2392111
DOI10.1007/s10898-012-9933-0zbMath1300.90032OpenAlexW2074582983MaRDI QIDQ2392111
Publication date: 1 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9933-0
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
A MILP formulation for generalized geometric programming using piecewise-linear approximations ⋮ A parametric linearizing approach for quadratically inequality constrained quadratic programs ⋮ Solving generalized polynomial problem by using new affine relaxed technique ⋮ Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ A practicable contraction approach for the sum of the generalized polynomial ratios problem ⋮ A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming ⋮ A novel optimization method for nonconvex quadratically constrained quadratic programs ⋮ An effective algorithm for globally solving quadratic programs using parametric linearization technique ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints ⋮ Inner approximation algorithm for generalized linear multiplicative programming problems ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints
Cites Work
- 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 stochastic geometric programming problem with multiplicative recourse
- Global solution of optimization problems with signomial parts
- A robust algorithm for generalized geometric programming
- Convexity of products of univariate functions and convexification transformations for geometric programming
- Some transformation techniques with applications in global optimization
- Reduction of indefinite quadratic programs to bilinear programs
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Generalized geometric programming applied to problems of optimal control. I: Theory
- Restricted multinomial maximum likelihood estimation based upon Fenchel duality
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Global optimization of signomial geometric programming using linear relaxation.
- Global optimization of generalized geometric programming
- A global optimization using linear relaxation for generalized geometric programming
- Effectiveness of a geometric programming algorithm for optimization of machining economics models
- A deterministic global optimization algorithm for generalized geometric programming
- Convex relaxation for solving posynomial programs
- An Efficient Global Approach for Posynomial Geometric Programming Problems
- Convex underestimation strategies for signomial functions
- Geometric Programming: Methods, Computations and Applications
- Generalized Polynomial Optimization
- Generalized Weighted Mean Programming
This page was built for publication: Branch-reduction-bound algorithm for generalized geometric programming
