Tractable Relaxations of Composite Functions
From MaRDI portal
Publication:5085133
DOI10.1287/moor.2021.1162zbMath1489.90068OpenAlexW3203742956MaRDI QIDQ5085133
Publication date: 27 June 2022
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2021.1162
supermodularityfactorable programmingstaircase triangulationmixed integer nonlinear programsconvexification via optimal transport
Inequalities; stochastic orderings (60E15) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Random variables, monotone relations, and convex analysis
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
- Extended formulations for convex hulls of some bilinear functions
- Stochastic orders
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Triangulations. Structures for algorithms and applications
- Recognition problems for special classes of polynomials in 0-1 variables
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Inequalities for distributions with given marginals
- The collected works of Wassily Hoeffding. Ed. by N. I. Fisher and P. K. Sen
- A convex envelope formula for multilinear functions
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Convex extensions and envelopes of lower semi-continuous functions
- Semidefinite programming relaxations for semialgebraic problems
- A polyhedral branch-and-cut approach to global optimization
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Explicit convex and concave envelopes through polyhedral subdivisions
- On convex relaxations of quadrilinear terms
- A new framework to relax composite functions in nonlinear programs
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- An efficient algorithm for determining the convex hull of a finite planar set
- On the notion of balance of a signed graph
- Global Optimization with Polynomials and the Problem of Moments
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Concave envelopes of monomial functions over rectangles
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A Lower Bound Technique for Triangulations of Simplotopes
- The Multilinear Polytope for Acyclic Hypergraphs
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- An Inequality for Rearrangements
- An Integral Inequality
