On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations
From MaRDI portal
Publication:5072594
DOI10.1137/21M1428583zbMath1491.90127arXiv2106.12629MaRDI QIDQ5072594
Felipe Serrano, Gonzalo Muñoz, Santanu S. Dey
Publication date: 29 April 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.12629
Related Items (1)
Cites Work
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Problems of distance geometry and convex properties of quadratic maps
- A remark on the rank of positive semidefinite matrices subject to affine constraints
- Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
- Aggregation-based cutting-planes for packing and covering integer programs
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- New SOCP relaxation and branching rule for bipartite bilinear programs
- A gentle, geometric introduction to copositive optimization
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Feasibility testing for systems of real quadratic equations
- On families of quadratic surfaces having fixed intersections with two hyperplanes
- The trust region subproblem with non-intersecting linear constraints
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Lectures on Modern Convex Optimization
- A Note on Polynomial Solvability of the CDT Problem
- Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem
- Convex hull of two quadratic constraints is an LMI set
- Matrix Analysis
- Linear Systems of Real Quadratic Forms. II
- New Results on Quadratic Minimization
- Maximal Quadratic-Free Sets
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming
- On Convex Hulls of Epigraphs of QCQPs
- The Convex Hull of a Quadratic Constraint over a Polytope
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- A Survey of the S-Lemma
- Lifting convex inequalities for bipartite bilinear programs
This page was built for publication: On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations
