Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
From MaRDI portal
Publication:524905
DOI10.1007/s10898-016-0418-4zbMath1393.90095OpenAlexW2281872831MaRDI QIDQ524905
Publication date: 27 April 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0418-4
Related Items (8)
Error bounds for monomial convexification in polynomial optimization ⋮ Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program ⋮ Convex envelopes of bivariate functions through the solution of KKT systems ⋮ Convexification of bilinear forms through non-symmetric lifting ⋮ Convex envelopes for ray-concave functions ⋮ Linear-Time Convexity Test for Low-Order Piecewise Polynomials
Cites Work
- Unnamed Item
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Recognition problems for special classes of polynomials in 0-1 variables
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A convex envelope formula for multilinear functions
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- Convex envelopes of bivariate functions through the solution of KKT systems
- 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
- 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
- Alternative branching rules for some nonconvex problems
- 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
- Semidefinite relaxations of fractional programs via novel convexification techniques
This page was built for publication: Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
