The Multilinear Polytope for Acyclic Hypergraphs

@article{Pia2018TheMP,
  title={The Multilinear Polytope for Acyclic Hypergraphs},
  author={Alberto Del Pia and Aida Khajavirad},
  journal={SIAM J. Optim.},
  year={2018},
  volume={28},
  pages={1049-1076}
}
We consider the multilinear polytope defined as the convex hull of the set of binary points $z$ satisfying a collection of equations of the form $z_e = \prod_{v \in e} {z_v}$, $e \in E$, where $E$ denotes a family of subsets of $\{1, \ldots , n\}$ of cardinality at least two. Such sets are of fundamental importance in many types of mixed-integer nonlinear optimization problems, such as $0-1$ polynomial optimization. Utilizing an equivalent hypergraph representation, we study the facial… 

Figures from this paper

On the impact of running intersection inequalities for globally solving polynomial optimization problems
TLDR
It is proved that separating flower inequalities, a subclass of running intersection inequalities, is NP-hard and an efficient polynomial-time algorithm for separatingRunning intersection inequalities is devised and embeds the proposed cutting-plane generation scheme at every node of the branch-and-reduce global solver BARON.
The Running Intersection Relaxation of the Multilinear Polytope
TLDR
It is shown that for kite-free β-acyclic hypergraphs, a class that lies between γ-acyClic and β-ACYclichyper graph, the running intersection relaxation is equal to MPG and it admits an extended formulation of polynomial size.
On decomposability of Multilinear sets
TLDR
This paper derives necessary and sufficient conditions under which S is decomposable into Sj, based on the structure of pair-wise intersection hypergraphs, and proposes a polynomial-time algorithm to optimally decompose a Multilinear set into simpler subsets.
On the complexity of binary polynomial optimization over acyclic hypergraphs
TLDR
This work proposes a strongly polynomial-time algorithm to successively remove nest points from the hypergraph, until there is only one node left, and shows that for $\alpha$-acyclic hypergraphs the problem is strongly NP- hard, and NP-hard to approximate within a constant factor larger than 16/17 provided that P $\neq$ NP.
Multilinear Sets with Two Monomials and Cardinality Constraints
TLDR
This paper gives an extended formulation, with two more auxiliary variables and exponentially many inequalities, of the convex hull of solutions of the standard linearization of this problem, and shows that the separation problem can be solved efficiently.
Multilinear Sets with Cardinality Constraints
TLDR
A cardinality constrained version of this problem with upper and lower bounds on the number of nonzero variables is studied, and an explicit polyhedral description of the convex hull when the multilinear terms have a nested structure is given.
Convexifying Multilinear Sets with Cardinality Constraints: Structural Properties, Nested Case and Extensions
TLDR
The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem and a cardinality constrained version of it with upper and lower bounds on the number of nonzero variables is studied.
Simple odd $\beta$-cycle inequalities for binary polynomial optimization
TLDR
A weaker version is introduced, called simple odd β-cycle inequalities, for which a strongly polynomial-time separation algorithm for arbitrary instances is established and still suffice to describe the multilinear polytope for cycle hypergraphs.
Simple odd $β$-cycle inequalities for binary polynomial optimization
TLDR
A weaker version is introduced, called simple odd β-cycle inequalities, for which a strongly polynomial-time separation algorithm for arbitrary instances is established and still suffice to describe the multilinear polytope for cycle hypergraphs.
...
...

References

SHOWING 1-10 OF 56 REFERENCES
On decomposability of Multilinear sets
TLDR
This paper derives necessary and sufficient conditions under which S is decomposable into Sj, based on the structure of pair-wise intersection hypergraphs, and proposes a polynomial-time algorithm to optimally decompose a Multilinear set into simpler subsets.
A Polyhedral Study of Binary Polynomial Programs
TLDR
An equivalent hypergraph representation of the mixed-integer set 𝒮 is defined, which enables us to derive several families of facet-defining inequalities, structural properties, and lifting operations for its convex hull in the space of the original variables.
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
TLDR
It is shown that for a random bilinear function b, c cannot be bounded by a constant independent of n, and it is proved that c⩽600n, which improves the linear upper bound proved by Luedtke, Namazifar and Linderoth.
CONVEX ENVELOPES OF MULTILINEAR FUNCTIONS OVER A UNIT HYPERCUBE AND OVER SPECIAL DISCRETE SETS
In this paper, we present some general as well as explicit characterizations of the convex envelope of multilinear functions deflned over a unit hypercube. A new approach is used to derive this
On the cut polytope
TLDR
It is shown that inequalities associated with chordless cycles define facets of this polytope; moreover, for these inequalities a polynomial algorithm to solve the separation problem is presented.
The boolean quadric polytope: Some characteristics, facets and relatives
TLDR
It is shown that the known polynomiality result for the maximization of nonnegative quadratic forms can be obtained by simply rounding the solution to the linear programming relaxation, and the Boolean quadric polytope QPn inn(n+1)/2 dimensions is considered.
Berge-acyclic multilinear 0-1 optimization problems
The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds
TLDR
The relation of these problems to the unconstrained quadratic 0–1 programming problem, and the known methods for lower and upper bounds to this optimization problem are surveyed.
Global optimization of nonconvex problems with multilinear intermediates
TLDR
This work proposes a graph decomposition scheme that exploits the structure of a multilinear function to decompose it to lower-dimensional components, for which the aforementioned LP can be solved very efficiently by employing a customized simplex algorithm.
...
...