On Convex Hulls of Epigraphs of QCQPs
From MaRDI portal
Publication:5041762
DOI10.1007/978-3-030-45771-6_32zbMath1503.90089arXiv2002.01566OpenAlexW3023541069MaRDI QIDQ5041762
Alex L. Wang, Fatma Kılınç-Karzan
Publication date: 14 October 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.01566
quadratically constrained quadratic programmingrelaxationconvex hullLagrange functionsemidefinite program
Related Items
On the tightness of SDP relaxations of QCQPs, On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations, Invariants of SDP exactness in quadratic programming, Ideal formulations for constrained convex optimization problems with indicator variables
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exactness conditions for an SDP relaxation of the extended trust region problem
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Two-term disjunctions on the second-order cone
- Dual quadratic estimates in polynomial and Boolean programming
- Semidefinite programming relaxation for nonconvex quadratic programs
- Approximating quadratic programming with bound and quadratic constraints
- Disjunctive cuts for cross-sections of the second-order cone
- Some results for quadratic problems with one or two quadratic constraints
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- The generalized trust region subproblem: solution complexity and convex hull results
- On the tightness of SDP relaxations of QCQPs
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic 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
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- The trust region subproblem with non-intersecting linear constraints
- Lectures on Modern Convex Optimization
- Exact Recovery in the Stochastic Block Model
- Integer Programming
- Convex hull of two quadratic constraints is an LMI set
- Quadratically constrained quadratic programming: Some applications and a method for solution
- New Results on Quadratic Minimization
- Clustering subgaussian mixtures by semidefinite programming
- Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization
- The Convex Hull of a Quadratic Constraint over a Polytope
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- Quadratic Matrix Programming
- On Cones of Nonnegative Quadratic Functions
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Phase Retrieval via Matrix Completion
- Handbook of semidefinite programming. Theory, algorithms, and applications
