Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 29, Issue 2, Pages 125-155Publisher
SPRINGER
DOI: 10.1023/B:JOGO.0000042112.72379.e6
Keywords
concave envelope; convex envelope; convex underestimators; trilinear monomial
Ask authors/readers for more resources
Convex underestimators of nonconvex functions, frequently used in deterministic global optimization algorithms, strongly influence their rate of convergence and computational efficiency. A good convex underestimator is as tight as possible and introduces a minimal number of new variables and constraints. Multilinear monomials over a coordinate aligned hyper-rectangular domain are known to have polyhedral convex envelopes which may be represented by a finite number of facet inducing inequalities. This paper describes explicit expressions de. ning the facets of the convex and concave envelopes of trilinear monomials over a box domain with bounds of opposite signs for at least one variable. It is shown that the previously used approximations based on the recursive use of the bilinear construction rarely yield the convex envelope itself.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available