Convex envelopes of bivariate functions through the solution of KKT systems
From MaRDI portal
Publication:1756774
DOI10.1007/s10898-018-0626-1zbMath1436.90111OpenAlexW2789925117WikidataQ130202818 ScholiaQ130202818MaRDI QIDQ1756774
Publication date: 21 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0626-1
Related Items (7)
Exact and approximate results for convex envelopes of special structured functions over simplices ⋮ Tight convex relaxations for the expansion planning problem ⋮ Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms ⋮ A new technique to derive tight convex underestimators (sometimes envelopes) ⋮ Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes ⋮ Convex envelope of bivariate cubic functions over rectangular regions ⋮ Convex envelopes for ray-concave functions
Cites Work
- Unnamed Item
- Convex envelopes of products of convex and component-wise concave functions
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- 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
- 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
- On convex envelopes for bivariate functions over polytopes
- Computable representations for convex hulls of low-dimensional quadratic forms
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- 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
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Analysis of bounds for multilinear functions
- Semidefinite relaxations of fractional programs via novel convexification techniques
This page was built for publication: Convex envelopes of bivariate functions through the solution of KKT systems
