Efficient Convexification Strategy for Generalized Geometric Programming Problems
From MaRDI portal
Publication:5138255
DOI10.1287/ijoc.2018.0850OpenAlexW2930570351MaRDI QIDQ5138255
Publication date: 3 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2018.0850
global optimizationconvex programminggeneralized geometric programmingconvexification strategyvariables transformation technique
Related Items
Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms ⋮ An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Treating free variables in generalized geometric global optimization programs
- Global solution of optimization problems with signomial parts
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Some transformation techniques with applications in global optimization
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Trigonometric convex underestimator for the base functions in Fourier space
- Convex envelopes for edge-concave functions
- Deterministic global optimization. Theory, methods and applications
- An efficient convexification method for solving generalized geometric problems
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Convex relaxation for solving posynomial programs
- Global Optimization of Mixed-Integer Signomial Programming Problems
- An Efficient Global Approach for Posynomial Geometric Programming Problems
- A Superior Representation Method for Piecewise Linear Functions
- Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables
- Convex underestimation strategies for signomial functions
- Digital Circuit Optimization via Geometric Programming
- Generalized Polynomial Optimization
- Optimal inventory policies under decreasing cost functions via geometric programming
This page was built for publication: Efficient Convexification Strategy for Generalized Geometric Programming Problems
