Pages that link to "Item:Q5131962"
From MaRDI portal
The following pages link to The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962):
Displaying 15 items.
- Convex hull representations for bounded products of variables (Q2046306) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
- A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints (Q5057970) (← links)
- On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations (Q5072594) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Convex hull results on quadratic programs with non-intersecting constraints (Q6126659) (← links)
- Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity (Q6136657) (← links)
- A disjunctive cutting plane algorithm for bilinear programming (Q6622752) (← links)
