Recommendations
- Explicit convex and concave envelopes through polyhedral subdivisions
- Non polyhedral convex envelopes for 1-convex functions
- Convex envelopes of products of convex and component-wise concave functions
- A convex envelope formula for multilinear functions
- Convex envelopes generated from finitely many compact convex sets
Cites work
- scientific article; zbMATH DE number 2068080 (Why is no real title available?)
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- 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
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- A polyhedral branch-and-cut approach to global optimization
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- Convex envelopes for edge-concave functions
- Convex envelopes generated from finitely many compact convex sets
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convex envelopes of products of convex and component-wise concave functions
- Convex extensions and envelopes of lower semi-continuous functions
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Explicit convex and concave envelopes through polyhedral subdivisions
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Library Automation
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- On convex relaxations of quadrilinear terms
- On generating instances for the modular distance geometry problem
- On nonconvex quadratic programming with box constraints
- Reduced RLT representations for nonconvex polynomial programming problems
- SCIP: solving constraint integer programs
- Semidefinite relaxations of fractional programs via novel convexification techniques
- The Convex Envelope of (n–1)-Convex Functions
- The hyperdeterminant and triangulations of the 4-cube
- The quickhull algorithm for convex hulls
Cited in
(13)- Convex envelopes of separable functions over regions defined by separable functions of the same type
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- Exact and approximate results for convex envelopes of special structured functions over simplices
- Controlled Envelopment by Face Extension in DEA
- (Global) optimization: historical notes and recent developments
- Convex envelope of bivariate cubic functions over rectangular regions
- Convex envelopes for ray-concave functions
- Convex envelopes of products of convex and component-wise concave functions
- A convex envelope formula for multilinear functions
- Extended formulations for convex hulls of some bilinear functions
- Non polyhedral convex envelopes for 1-convex functions
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
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)
