On the Composition of Convex Envelopes for Quadrilinear Terms
From MaRDI portal
Publication:5244679
DOI10.1007/978-1-4614-5131-0_1zbMath1309.90062OpenAlexW2273061162MaRDI QIDQ5244679
Sonia Cafieri, Andrew J. Miller, Jon Lee, Pietro Belotti, Leo Liberti
Publication date: 30 March 2015
Published in: Optimization, Simulation, and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-5131-0_1
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (4)
Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Piecewise polyhedral formulations for a multilinear term ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ Multivariate McCormick relaxations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A convex envelope formula for multilinear functions
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convex extensions and envelopes of lower semi-continuous functions
- Convex envelopes of monomials of odd degree
- Convex envelopes for edge-concave functions
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- A branch-and-reduce approach to global optimization
- Some results on the strength of relaxations of multilinear functions
- On convex relaxations of quadrilinear terms
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Molecular distance geometry methods: from continuous to discrete
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- On Linear Characterizations of Combinatorial Optimization Problems
This page was built for publication: On the Composition of Convex Envelopes for Quadrilinear Terms
