Deriving convex hulls through lifting and projection
From MaRDI portal
Publication:1646568
DOI10.1007/s10107-017-1138-3zbMath1410.90132OpenAlexW2606063390MaRDI QIDQ1646568
Jean-Philippe P. Richard, Mohit Tawarmalani, Trang T. Nguyen
Publication date: 25 June 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1138-3
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Approximation by convex sets (52A27)
Related Items
Convex envelopes of separable functions over regions defined by separable functions of the same type, Exact and approximate results for convex envelopes of special structured functions over simplices, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, (Global) optimization: historical notes and recent developments, A new technique to derive tight convex underestimators (sometimes envelopes), Supermodularity and valid inequalities for quadratic optimization with indicators, Strong Convex Nonlinear Relaxations of the Pooling Problem, A new framework to relax composite functions in nonlinear programs, Lifting convex inequalities for bipartite bilinear programs, Convex hull representations for bounded products of variables, Lifting convex inequalities for bipartite bilinear programs, New SOCP relaxation and branching rule for bipartite bilinear programs, Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization, Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convex envelopes for edge-concave functions
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Some results on the strength of relaxations of multilinear functions
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- On convex envelopes for bivariate functions over polytopes
- Computable representations for convex hulls of low-dimensional quadratic forms
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- The Convex Envelope of (n–1)-Convex Functions
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Optimization Problems with Perturbations: A Guided Tour
- Convex Analysis
- Semidefinite relaxations of fractional programs via novel convexification techniques
