Convex envelopes of bivariate functions through the solution of KKT systems
The concept of the convex envelope of a function \(f\) over a compact region \(X\) in \(R^n\) is defined as the best convex underestimator of a non-convex function \(f\). It can be expressed as the supremum of all affine underestimators of \(f\) over \(X\). The author describes in the paper a variant of the approach to the problem of finding the convex envelope of bivariate functions over polytopes, which was published by \textit{M. Locatelli} and \textit{F. Schoen} [Math. Program. 144, No. 1--2 (A), 65--91 (2014; Zbl 1295.90055)]. The proposed procedure based on the solution of a KKT system simplifies the previously published method for finding convex envelopes published in the paper by Locatelli and Schoen in [loc. cit.]. The following two special cases are discussed: deriving the convex envelope of a bilinear function over general polytopes and deriving the convex envelope of the product of power functions over boxes.
- On convex envelopes for bivariate functions over polytopes
- The Convex Envelope of (n–1)-Convex Functions
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- A technique to derive the analytical form of convex envelopes for some bivariate functions
- Convex envelope of bivariate cubic functions over rectangular regions
- 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
- Computing uniform convex approximations for convex envelopes and convex hulls
- 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
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Explicit convex and concave envelopes through polyhedral subdivisions
- Jointly Constrained Biconvex Programming
- On convex envelopes for bivariate functions over polytopes
- On convex relaxations for quadratically constrained quadratic programming
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- Semidefinite relaxations of fractional programs via novel convexification techniques
- The Convex Envelope of (n–1)-Convex Functions
- Convex and concave envelopes: revisited and new perspectives
- Convex envelopes for ray-concave functions
- Exact and approximate results for convex envelopes of special structured functions over simplices
- 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
- Convex envelope of bivariate cubic functions over rectangular regions
- On convex envelopes for bivariate functions over polytopes
- Tight convex relaxations for the expansion planning problem
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- A new technique to derive tight convex underestimators (sometimes envelopes)
- A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions
- Cutting planes for signomial programming
- Simultaneous convexification for the planar obnoxious facility location problem
- Global optimization of mixed-integer nonlinear programs with SCIP 8
- Computing the convex envelope of bivariate piecewise linear-quadratic functions in linear time
This page was built for publication: Convex envelopes of bivariate functions through the solution of KKT systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756774)
