Extended formulations for convex envelopes
From MaRDI portal
Publication:486393
DOI10.1007/s10898-013-0104-8zbMath1335.90070OpenAlexW1982638837MaRDI QIDQ486393
Dennis Michaels, Martin Ballerstein
Publication date: 15 January 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/325431/files/10898_2013_Article_104.pdf
convex envelopereformulation-linearization-techniqueextended formulationedge-concave functionssimultaneous convexification
Related Items (7)
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 ⋮ Non polyhedral convex envelopes for 1-convex functions ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ (Global) optimization: historical notes and recent developments ⋮ Convex envelope of bivariate cubic functions over rectangular regions ⋮ Extended formulations for convex hulls of some bilinear functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Reduced RLT representations for nonconvex polynomial programming problems
- Convex envelopes of products of convex and component-wise concave functions
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
- SCIP: solving constraint integer programs
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Existence and sum decomposition of vertex polyhedral convex envelopes
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- 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 for edge-concave functions
- A polyhedral branch-and-cut approach to global optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- On convex relaxations of quadrilinear terms
- Computable representations for convex hulls of low-dimensional quadratic forms
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Library Automation
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- The Convex Envelope of (n–1)-Convex Functions
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- On Nonconvex Quadratic Programming with Box Constraints
- The hyperdeterminant and triangulations of the 4-cube
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- The quickhull algorithm for convex hulls
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Semidefinite relaxations of fractional programs via novel convexification techniques
This page was built for publication: Extended formulations for convex envelopes
