Convex hull representations for bounded products of variables

DOI10.1007/s10898-021-01046-7zbMath1475.90037arXiv2004.07233OpenAlexW3172776131MaRDI QIDQ2046306

Samuel Burer, Kurt M. Anstreicher, Kyungchan Park

Publication date: 17 August 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.07233

zbMATH Keywords

global optimizationconvex hullsecond-order conebilinear product

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items

Tightening methods based on nontrivial bounds on bilinear terms, Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms, Lifting convex inequalities for bipartite bilinear programs

Uses Software

• BARON

Cites Work

• Unnamed Item
• Unnamed Item
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• A new reformulation-linearization technique for bilinear programming problems
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Deriving convex hulls through lifting and projection
• Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
• On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• BARON: A general purpose global optimization software package
• New SOCP relaxation and branching rule for bipartite bilinear programs
• Strong formulations for the pooling problem
• Computable representations for convex hulls of low-dimensional quadratic forms
• The Convex Envelope of (n–1)-Convex Functions
• Branching and bounds tighteningtechniques for non-convex MINLP
• Jointly Constrained Biconvex Programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• The Convex Hull of a Quadratic Constraint over a Polytope