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-4zbMATH Open1393.90095OpenAlexW2281872831MaRDI QIDQ524905FDOQ524905
Authors: Marco Locatelli 
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
Recommendations
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- On convex envelopes for bivariate functions over polytopes
- Explicit convex and concave envelopes through polyhedral subdivisions
- Non polyhedral convex envelopes for 1-convex functions
- Convex envelopes of bivariate functions through the solution of KKT systems
Cites Work
- Explicit convex and concave envelopes through polyhedral subdivisions
- Semidefinite relaxations of fractional programs via novel convexification techniques
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A convex envelope formula for multilinear functions
- Convex envelopes for edge-concave functions
- On convex envelopes for bivariate functions over polytopes
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- On convex relaxations for quadratically constrained quadratic programming
- 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
- The Convex Envelope of (n–1)-Convex Functions
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Alternative branching rules for some nonconvex problems
- Computing uniform convex approximations for convex envelopes and convex hulls
- Recognition problems for special classes of polynomials in 0-1 variables
- Convex envelopes of bivariate functions through the solution of KKT systems
Cited In (15)
- Linear-time convexity test for low-order piecewise polynomials
- Convex envelopes of bivariate functions through the solution of KKT systems
- The convex hull of a quadratic constraint over a polytope
- Explicit convex and concave envelopes through polyhedral subdivisions
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- Convexification of bilinear forms through non-symmetric lifting
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- Error bounds for monomial convexification in polynomial optimization
- On convex envelopes for bivariate functions over polytopes
- A technique to derive the analytical form of convex envelopes for some bivariate functions
- Convex envelope of bivariate cubic functions over rectangular regions
- Convex envelopes for ray-concave functions
- Extended formulations for convex hulls of some bilinear functions
- Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q524905)
