The Convex Hull of a Quadratic Constraint over a Polytope
From MaRDI portal
Publication:5131962
DOI10.1137/19M1277333zbMath1453.90115arXiv1812.10160OpenAlexW3093436698MaRDI QIDQ5131962
Asteroide Santana, Santanu S. Dey
Publication date: 9 November 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.10160
Related Items (15)
On Convex Hulls of Epigraphs of QCQPs ⋮ On the tightness of SDP relaxations of QCQPs ⋮ A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints ⋮ On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ Monoidal strengthening and unique lifting in MIQCPs ⋮ (Global) optimization: historical notes and recent developments ⋮ Convex hull results on quadratic programs with non-intersecting constraints ⋮ Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Convex hull representations for bounded products of variables ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Maximal quadratic-free sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Exact computable representation of some second-order cone constrained quadratic programming problems
- Relaxations and discretizations for the pooling problem
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Extended formulations for convex hulls of some bilinear functions
- Linear programs with an additional reverse convex constraint
- A new reformulation-linearization technique for bilinear programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A convex envelope formula for multilinear functions
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convex envelopes of monomials of odd degree
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- A class of valid inequalities for multilinear 0-1 optimization problems
- Convex envelopes for edge-concave functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Explicit convex and concave envelopes through polyhedral subdivisions
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- New SOCP relaxation and branching rule for bipartite bilinear programs
- Global optimization of nonconvex problems with multilinear intermediates
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Strong formulations for the pooling problem
- On representing the positive semidefinite cone using the second-order cone
- Error bounds for monomial convexification in polynomial optimization
- Facets of a mixed-integer bilinear covering set with bounds on variables
- On families of quadratic surfaces having fixed intersections with two hyperplanes
- The trust region subproblem with non-intersecting linear constraints
- Computable representations for convex hulls of low-dimensional quadratic forms
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Global Optimization with Polynomials and the Problem of Moments
- Lectures on Modern Convex Optimization
- .879-approximation algorithms for MAX CUT and MAX 2SAT
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Strong SOCP Relaxations for the Optimal Power Flow Problem
- Convexification Techniques for Linear Complementarity Constraints
- Concave envelopes of monomial functions over rectangles
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Analysis of MILP Techniques for the Pooling Problem
- Convex hull of two quadratic constraints is an LMI set
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Quantifying Double McCormick
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction
- Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- A Polyhedral Study of Binary Polynomial Programs
- Convex analysis and global optimization
- Analysis of bounds for multilinear functions
- Semidefinite relaxations of fractional programs via novel convexification techniques
This page was built for publication: The Convex Hull of a Quadratic Constraint over a Polytope
