Convex underestimation for posynomial functions of positive variables
From MaRDI portal
Publication:941023
DOI10.1007/s11590-007-0061-6zbMath1152.90610OpenAlexW2168664473MaRDI QIDQ941023
Christodoulos A. Floudas, Jung-Fa Tsai, Han-Lin Li
Publication date: 4 September 2008
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-007-0061-6
Related Items
A review of recent advances in global optimization, Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms, Convex relaxation for solving posynomial programs, A reformulation framework for global optimization, Multi-parametric disaggregation technique for global optimization of polynomial programming problems, A review of deterministic optimization methods in engineering and management, Relaxations of factorable functions with convex-transformable intermediates, Copula theory approach to stochastic geometric programming, Global optimization of nonconvex problems with convex-transformable intermediates, Reformulations for utilizing separability when solving convex MINLP problems, Convexity of products of univariate functions and convexification transformations for geometric programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Treating free variables in generalized geometric global optimization programs
- Generalized concavity
- Convex extensions and envelopes of lower semi-continuous 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
- Global optimization of 0-1 hyperbolic programs
- Product disaggregation in global optimization and relaxations of rational programs
- 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
- Semidefinite relaxations of fractional programs via novel convexification techniques
