On convex envelopes for bivariate functions over polytopes

DOI10.1007/S10107-012-0616-XzbMath1295.90055OpenAlexW2102102359MaRDI QIDQ2452372

Marco Locatelli, Fabio Schoen

Publication date: 2 June 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0616-x

zbMATH Keywords

convex envelopessemi-definite programming, quadratic problems, non-convex programming, global optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items (18)

Global optimization with spline constraints: a new branch-and-bound method based on B-splines ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Deriving convex hulls through lifting and projection ⋮ Alternative branching rules for some nonconvex problems ⋮ Error bounds for monomial convexification in polynomial optimization ⋮ Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction ⋮ \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables ⋮ Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program ⋮ Convex and concave envelopes: revisited and new perspectives ⋮ A technique to derive the analytical form of convex envelopes for some bivariate functions ⋮ ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations ⋮ Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes ⋮ Convex envelopes of bivariate functions through the solution of KKT systems ⋮ On tightness and anchoring of McCormick and other relaxations ⋮ Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks ⋮ Convex envelopes for ray-concave functions

Cites Work

• 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
• Convex envelopes for edge-concave functions
• A polyhedral branch-and-cut approach to global optimization
• On convex relaxations for quadratically constrained quadratic programming
• An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
• Global minimization of rational functions and the nearest GCDs
• Computable representations for convex hulls of low-dimensional quadratic forms
• Jointly Constrained Biconvex Programming
• Convex Analysis
• Analysis of bounds for multilinear functions
• Semidefinite relaxations of fractional programs via novel convexification techniques

This page was built for publication: On convex envelopes for bivariate functions over polytopes