A convex envelope formula for multilinear functions
From MaRDI portal
Publication:1361080
DOI10.1023/A:1008217604285zbMath0881.90099OpenAlexW1497465005MaRDI QIDQ1361080
Publication date: 23 July 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008217604285
polyhedral functionbilinear optimizationconcave extensionnonlinear 0-1 programmingconvex envelopes of multilinear functions
Related Items (81)
Graph, clique and facet of Boolean logical polytope ⋮ Bounding duality gap for separable problems with linear constraints ⋮ Exact and approximate results for convex envelopes of special structured functions over simplices ⋮ Non polyhedral convex envelopes for 1-convex functions ⋮ A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Divisive heuristic for modularity density maximization ⋮ On linear programming relaxations for solving polynomial programming problems ⋮ On decomposability of multilinear sets ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ Fortification Against Cascade Propagation Under Uncertainty ⋮ Tractable Relaxations of Composite Functions ⋮ Piecewise polyhedral formulations for a multilinear term ⋮ An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ Some results on the strength of relaxations of multilinear functions ⋮ Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 ⋮ Alternative branching rules for some nonconvex problems ⋮ Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality ⋮ Error bounds for monomial convexification in polynomial optimization ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex ⋮ Time-flexible min completion time variance in a single machine by quadratic programming ⋮ (Global) optimization: historical notes and recent developments ⋮ On the impact of running intersection inequalities for globally solving polynomial optimization problems ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ A new technique to derive tight convex underestimators (sometimes envelopes) ⋮ Convex envelopes generated from finitely many compact convex sets ⋮ A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ A new necessary and sufficient global optimality condition for canonical DC problems ⋮ Convex envelopes of products of convex and component-wise concave functions ⋮ On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations ⋮ Explicit convex and concave envelopes through polyhedral subdivisions ⋮ Rigorous filtering using linear relaxations ⋮ On convex relaxations of quadrilinear terms ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program ⋮ On convex envelopes for bivariate functions over polytopes ⋮ Convex and concave envelopes: revisited and new perspectives ⋮ The Multilinear Polytope for Acyclic Hypergraphs ⋮ Existence and sum decomposition of vertex polyhedral convex envelopes ⋮ Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON ⋮ A new framework to relax composite functions in nonlinear programs ⋮ An almost exact solution to the min completion time variance in a single machine ⋮ Relaxations and discretizations for the pooling problem ⋮ Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions ⋮ Complete mixed integer linear programming formulations for modularity density based clustering ⋮ Easy and optimal queries to reduce set uncertainty ⋮ A technique to derive the analytical form of convex envelopes for some bivariate functions ⋮ Multivariate McCormick relaxations ⋮ A note on solving DiDi's driver-order matching problem ⋮ Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes ⋮ On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation ⋮ Global optimization of nonconvex problems with convex-transformable intermediates ⋮ Convex envelopes of bivariate functions through the solution of KKT systems ⋮ A new global optimization approach for convex multiplicative programming ⋮ Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems ⋮ Experimental validation of volume-based comparison for double-McCormick relaxations ⋮ Perspective cuts for a class of convex 0-1 mixed integer programs ⋮ Unnamed Item ⋮ Outer approximation algorithms for canonical DC problems ⋮ An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs ⋮ A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ Convex envelopes for edge-concave functions ⋮ \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation ⋮ Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 ⋮ MIP relaxations in factorable programming ⋮ Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks ⋮ Convex envelope of bivariate cubic functions over rectangular regions ⋮ A linearization framework for unconstrained quadratic (0-1) problems ⋮ Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes ⋮ Convex envelopes for ray-concave functions ⋮ On the Composition of Convex Envelopes for Quadrilinear Terms ⋮ Extended formulations for convex hulls of some bilinear functions ⋮ New SOCP relaxation and branching rule for bipartite bilinear programs ⋮ Modified modularity density maximization and density ratio heuristic ⋮ Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis ⋮ Global optimization of nonconvex problems with multilinear intermediates
This page was built for publication: A convex envelope formula for multilinear functions
