Extended formulations for convex envelopes
From MaRDI portal
Publication:486393
DOI10.1007/S10898-013-0104-8zbMATH Open1335.90070OpenAlexW1982638837MaRDI QIDQ486393FDOQ486393
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
extended formulationreformulation-linearization-techniqueconvex envelopeedge-concave functionssimultaneous convexification
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- SCIP: solving constraint integer programs
- The quickhull algorithm for convex hulls
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Convex extensions and envelopes of lower semi-continuous functions
- A polyhedral branch-and-cut approach to global optimization
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- 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
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Convex envelopes for edge-concave functions
- Branching and bounds tighteningtechniques for non-convex MINLP
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Computable representations for convex hulls of low-dimensional quadratic forms
- Library Automation
- The Convex Envelope of (n–1)-Convex Functions
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Convex envelopes of products of convex and component-wise concave functions
- Existence and sum decomposition of vertex polyhedral convex envelopes
- On convex relaxations of quadrilinear terms
- Reduced RLT representations for nonconvex polynomial programming problems
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
- On Nonconvex Quadratic Programming with Box Constraints
- The hyperdeterminant and triangulations of the 4-cube
Cited In (10)
- Controlled Envelopment by Face Extension in DEA
- 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
- Explicit convex and concave envelopes through polyhedral subdivisions
- Non polyhedral convex envelopes for 1-convex functions
- A convex envelope formula for multilinear 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
This page was built for publication: Extended formulations for convex envelopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486393)
