An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
From MaRDI portal
Publication:2276885
A bilinear function f(\(\cdot)\) is minimized over a D-polytope, i.e. a polytope with ``downward sloping edges. An explicit characterization of convex envelopes of f(\(\cdot)\) is derived which may be useful in constructing branch-and-bound algorithms. Some generalizations to the non D-polytopes are discussed.
Recommendations
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- On convex envelopes for bivariate functions over polytopes
- Convex envelopes of bivariate functions through the solution of KKT systems
- Convex and concave envelopes: revisited and new perspectives
- A convex envelope formula for multilinear functions
Cites work
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Concave Minimization Via Collapsing Polytopes
- Constrained global optimization: algorithms and applications
- Convex Analysis
- Jointly Constrained Biconvex Programming
- Lagrange Multipliers and Nonconvex Programs
- Supports and convex envelopes
Cited in
(29)- A new reformulation-linearization technique for bilinear programming problems
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Two new reformulation convexification based hierarchies for 0-1 MIPs
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
- Convex envelopes of bivariate functions through the solution of KKT systems
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Explicit convex and concave envelopes through polyhedral subdivisions
- Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems
- Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes
- Convex envelopes for ray-concave functions
- The value of shape constraints in discrete moment problems: a review and extension
- 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
- Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model
- Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
- On convex envelopes for bivariate functions over polytopes
- Finding the exact lower estimate of the maximin of a minimum function on a polyhedron of connected variables
- Tight convex relaxations for the expansion planning problem
- The bipartite Boolean quadric polytope
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- Non polyhedral convex envelopes for 1-convex functions
- The convex hull of a quadratic constraint over a polytope
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions
- Computing the convex envelope of bivariate piecewise linear-quadratic functions in linear time
- Extended formulations for convex hulls of some bilinear functions
- Existence and sum decomposition of vertex polyhedral convex envelopes
This page was built for publication: An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276885)
