Convex relaxation for solving posynomial programs
From MaRDI portal
Publication:2655346
DOI10.1007/s10898-009-9414-2zbMath1181.90225MaRDI QIDQ2655346
Han-Lin Li, Christodoulos A. Floudas, Hao-Chun Lu, Chrysanthos E. Gounaris
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
90C26: Nonconvex programming, global optimization
Related Items
Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems, Multi-parametric disaggregation technique for global optimization of polynomial programming problems, A review of deterministic optimization methods in engineering and management, Branch-reduction-bound algorithm for generalized geometric programming, Relaxations of factorable functions with convex-transformable intermediates, Global Optimization of Mixed-Integer Signomial Programming Problems
Uses Software
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
