The Convex Envelope of (n–1)-Convex Functions
From MaRDI portal
Publication:3395026
DOI10.1137/07069359XzbMath1176.90467OpenAlexW2068054962MaRDI QIDQ3395026
Robert Weismantel, Dennis Michaels, Matthias Jach
Publication date: 20 August 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/07069359x
Related Items
Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations, 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, Computable representations for convex hulls of low-dimensional quadratic forms, Deriving convex hulls through lifting and projection, Tight convex relaxations for the expansion planning problem, Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex, (Global) optimization: historical notes and recent developments, A new technique to derive tight convex underestimators (sometimes envelopes), Convex envelopes generated from finitely many compact convex sets, Convex envelopes of products of convex and component-wise concave functions, On convex relaxations of quadrilinear terms, Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program, Relaxations of factorable functions with convex-transformable intermediates, Extended formulations for convex envelopes, A new framework to relax composite functions in nonlinear programs, A technique to derive the analytical form of convex envelopes for some bivariate functions, Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes, On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation, Global optimization of nonconvex problems with convex-transformable intermediates, Convex envelopes of bivariate functions through the solution of KKT systems, Unnamed Item, Quadratic optimization with switching variables: the convex hull for \(n=2\), Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks, Convex hull representations for bounded products of variables, Convex envelope of bivariate cubic functions over rectangular regions, Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes, Convex envelopes for ray-concave functions, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
Uses Software
