Exact and approximate results for convex envelopes of special structured functions over simplices
From MaRDI portal
Publication:2141722
DOI10.1007/s10898-021-01112-0zbMath1493.90147OpenAlexW3214285425MaRDI QIDQ2141722
Publication date: 25 May 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01112-0
Cites Work
- Unnamed Item
- Unnamed Item
- Non polyhedral convex envelopes for 1-convex functions
- Convex envelopes of products of convex and component-wise concave functions
- Extended formulations for convex envelopes
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Handbook of global optimization
- A convex envelope formula for multilinear functions
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convex envelopes of monomials of odd degree
- Deriving convex hulls through lifting and projection
- On decomposability of multilinear sets
- Convex envelopes of bivariate functions through the solution of KKT systems
- Convex envelopes for edge-concave functions
- 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
- Convex envelope of bivariate cubic functions over rectangular regions
- Error bounds for monomial convexification in polynomial optimization
- The Convex Envelope of (n–1)-Convex Functions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Semidefinite relaxations of fractional programs via novel convexification techniques
This page was built for publication: Exact and approximate results for convex envelopes of special structured functions over simplices
