Convex relaxation for solving posynomial programs

DOI10.1007/s10898-009-9414-2zbMath1181.90225OpenAlexW1992477052MaRDI QIDQ2655346

Chrysanthos E. Gounaris, Hao-Chun Lu, Han-Lin Li, Christodoulos A. Floudas

Publication date: 25 January 2010

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-009-9414-2

zbMATH Keywords

convex underestimationposynomial functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

Global Optimization of Mixed-Integer Signomial Programming Problems ⋮ Branch-reduction-bound algorithm for generalized geometric programming ⋮ Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms ⋮ Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms ⋮ Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains ⋮ Multi-parametric disaggregation technique for global optimization of polynomial programming problems ⋮ Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems ⋮ A review of deterministic optimization methods in engineering and management ⋮ Efficient Convexification Strategy for Generalized Geometric Programming Problems ⋮ Relaxations of factorable functions with convex-transformable intermediates ⋮ Global optimization of nonconvex problems with convex-transformable intermediates ⋮ A parsimonious model for generating arbitrage-free scenario trees

Uses Software

• BARON
• CONOPT
• GAMS
• NEOS

Cites Work

• Unnamed Item
• Convex underestimation for posynomial functions of positive variables
• Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
• Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
• Convex envelopes of monomials of odd degree
• 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
• Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
• Finding all solutions of nonlinearly constrained systems of equations
• A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
• Analysis of bounds for multilinear functions