Efficient Convexification Strategy for Generalized Geometric Programming Problems

DOI10.1287/IJOC.2018.0850OpenAlexW2930570351MaRDI QIDQ5138255FDOQ5138255

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

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

global optimization convex programming generalized geometric programming convexification strategy variables transformation technique

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

Computational experience with a new class of convex underestimators: Box-constrained NLP problems
Deterministic global optimization. Theory, methods and applications
A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
A superior representation method for piecewise linear functions
Global optimization for generalized geometric programs with mixed free-sign variables
Some transformation techniques with applications in global optimization
Global optimization of mixed-integer signomial programming problems
An efficient global approach for posynomial geometric programming problems
Convex underestimation strategies for signomial functions
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
Global solution of optimization problems with signomial parts
Convex envelopes for edge-concave functions
An efficient convexification method for solving generalized geometric problems
Treating free variables in generalized geometric global optimization programs
Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Digital Circuit Optimization via Geometric Programming
Generalized Polynomial Optimization
Optimal inventory policies under decreasing cost functions via geometric programming
Convex relaxation for solving posynomial 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)