Non polyhedral convex envelopes for 1-convex functions
From MaRDI portal
(Redirected from Publication:312465)
Recommendations
- Explicit convex and concave envelopes through polyhedral subdivisions
- Convex envelopes generated from finitely many compact convex sets
- On convex envelopes for bivariate functions over polytopes
- Convex envelope of bivariate cubic functions over rectangular regions
- Convex envelopes of products of convex and component-wise concave functions
Cites work
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A convex envelope formula for multilinear functions
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A technique to derive the analytical form of convex envelopes for some bivariate functions
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- Analysis of bounds for multilinear functions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- Concave extensions for nonlinear 0-1 maximization problems
- 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
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Explicit convex and concave envelopes through polyhedral subdivisions
- Extended formulations for convex envelopes
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Jointly Constrained Biconvex Programming
- Library Automation
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- On convex relaxations for quadratically constrained quadratic programming
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- Semidefinite relaxations of fractional programs via novel convexification techniques
- The Convex Envelope of (n–1)-Convex Functions
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
Cited in
(10)- The Convex Envelope of (n–1)-Convex Functions
- A new technique to derive tight convex underestimators (sometimes envelopes)
- Exact and approximate results for convex envelopes of special structured functions over simplices
- Concave envelopes of monomial functions over rectangles
- Extended formulations for convex envelopes
- scientific article; zbMATH DE number 2068080 (Why is no real title available?)
- (Global) optimization: historical notes and recent developments
- Convex envelope of bivariate cubic functions over rectangular regions
- Convex envelopes for ray-concave functions
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
This page was built for publication: Non polyhedral convex envelopes for 1-convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312465)
