Efficient Convexification Strategy for Generalized Geometric Programming Problems
From MaRDI portal
Publication:5138255
Recommendations
- An efficient convexification method for solving generalized geometric problems
- Global optimization of signomial geometric programming problems
- An efficient global approach for posynomial geometric programming problems
- On generalized geometric programming problems with non-positive variables
- Convex underestimation strategies for signomial functions
Cites work
- scientific article; zbMATH DE number 2068063 (Why is no real title available?)
- scientific article; zbMATH DE number 2068080 (Why is no real title available?)
- scientific article; zbMATH DE number 1857684 (Why is no real title available?)
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- A superior representation method for piecewise linear functions
- An efficient convexification method for solving generalized geometric problems
- An efficient global approach for posynomial geometric programming problems
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Convex envelopes for edge-concave functions
- Convex relaxation for solving posynomial programs
- Convex underestimation strategies for signomial functions
- Deterministic global optimization. Theory, methods and applications
- Digital Circuit Optimization via Geometric Programming
- Generalized Polynomial Optimization
- Global optimization for generalized geometric programs with mixed free-sign variables
- Global optimization of mixed-integer signomial programming problems
- Global solution of optimization problems with signomial parts
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Optimal inventory policies under decreasing cost functions via geometric programming
- Some transformation techniques with applications in global optimization
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Treating free variables in generalized geometric global optimization programs
- Trigonometric convex underestimator for the base functions in Fourier space
Cited in
(4)- Structural filtering: a paradigm for efficient and exact geometric programs
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms
- An efficient global approach for posynomial geometric programming problems
This page was built for publication: Efficient Convexification Strategy for Generalized Geometric Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138255)
