Non polyhedral convex envelopes for 1-convex functions
From MaRDI portal
Publication:312465
DOI10.1007/s10898-016-0409-5zbMath1377.90067OpenAlexW2268050327MaRDI QIDQ312465
Publication date: 15 September 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0409-5
Related Items (4)
Exact and approximate results for convex envelopes of special structured functions over simplices ⋮ (Global) optimization: historical notes and recent developments ⋮ A new technique to derive tight convex underestimators (sometimes envelopes) ⋮ Convex envelope of bivariate cubic functions over rectangular regions
Uses Software
Cites Work
- Convex envelopes of products of convex and component-wise concave functions
- Extended formulations for convex envelopes
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Concave extensions for nonlinear 0-1 maximization problems
- Existence and sum decomposition of vertex polyhedral convex envelopes
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A convex envelope formula for multilinear functions
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- Convex envelopes for edge-concave functions
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- On convex relaxations for quadratically constrained quadratic programming
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- 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
- Computable representations for convex hulls of low-dimensional quadratic forms
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Library Automation
- The Convex Envelope of (n–1)-Convex Functions
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Analysis of bounds for multilinear functions
- Semidefinite relaxations of fractional programs via novel convexification techniques
This page was built for publication: Non polyhedral convex envelopes for 1-convex functions
