Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
From MaRDI portal
Publication:1384437
zbMath0914.90205MaRDI QIDQ1384437
Publication date: 13 April 1998
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Related Items (43)
Exact and approximate results for convex envelopes of special structured functions over simplices ⋮ Non polyhedral convex envelopes for 1-convex functions ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Deriving convex hulls through lifting and projection ⋮ On linear programming relaxations for solving polynomial programming problems ⋮ On decomposability of multilinear sets ⋮ Tractable Relaxations of Composite Functions ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ Some results on the strength of relaxations of multilinear functions ⋮ Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality ⋮ Error bounds for monomial convexification in polynomial optimization ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ On the impact of running intersection inequalities for globally solving polynomial optimization problems ⋮ Convex envelopes generated from finitely many compact convex sets ⋮ On the strength of recursive McCormick relaxations for binary polynomial optimization ⋮ Convex envelopes of products of convex and component-wise concave functions ⋮ Explicit convex and concave envelopes through polyhedral subdivisions ⋮ Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ On convex envelopes for bivariate functions over polytopes ⋮ Relaxations of factorable functions with convex-transformable intermediates ⋮ Convex and concave envelopes: revisited and new perspectives ⋮ Extended formulations for convex envelopes ⋮ The Multilinear Polytope for Acyclic Hypergraphs ⋮ Existence and sum decomposition of vertex polyhedral convex envelopes ⋮ A new framework to relax composite functions in nonlinear programs ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ Two new reformulation convexification based hierarchies for 0-1 MIPs ⋮ Relaxations and discretizations for the pooling problem ⋮ Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions ⋮ Easy and optimal queries to reduce set uncertainty ⋮ A technique to derive the analytical form of convex envelopes for some bivariate functions ⋮ Global optimization of general nonconvex problems with intermediate polynomial substructures ⋮ A note on solving DiDi's driver-order matching problem ⋮ Global optimization of nonconvex problems with convex-transformable intermediates ⋮ Convex envelopes of bivariate functions through the solution of KKT systems ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ Convex envelopes for edge-concave functions ⋮ A linearization framework for unconstrained quadratic (0-1) problems ⋮ Convex envelopes for ray-concave functions ⋮ On the Composition of Convex Envelopes for Quadrilinear Terms ⋮ Extended formulations for convex hulls of some bilinear functions ⋮ Global optimization of nonconvex problems with multilinear intermediates
This page was built for publication: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
