Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity
From MaRDI portal
Publication:6136657
DOI10.1137/22m1528215zbMath1529.90054arXiv2210.01722OpenAlexW4390613562MaRDI QIDQ6136657
Shengding Sun, Santanu S. Dey, Grigoriy Blekherman
Publication date: 17 January 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.01722
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Polynomial optimization (90C23)
Cites Work
- Unnamed Item
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
- Quadratic programs with hollows
- Aggregation-based cutting-planes for packing and covering integer programs
- Convexity of quadratic transformations and its use in control and optimization
- On the tightness of SDP relaxations of QCQPs
- 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
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- On the Field of Values of a Matrix
- Convex hull of two quadratic constraints is an LMI set
- Matrix Analysis
- Linear Systems of Real Quadratic Forms. II
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming
- On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations
- The Convex Hull of a Quadratic Constraint over a Polytope
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- A Survey of the S-Lemma
- On the mapping of quadratic forms
This page was built for publication: Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity
