Convex hull of two quadratic constraints is an LMI set

DOI10.1093/imamci/dnp023zbMath1187.90227OpenAlexW2027846478MaRDI QIDQ3550740

Ugur Yildiran

Publication date: 6 April 2010

Published in: IMA Journal of Mathematical Control and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imamci/dnp023

zbMATH Keywords

quadratic programmingSDP relaxationconvex hullmatrix pencilS-LemmaLMI representation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (10)

Convex hull of two quadratic or a conic quadratic and a quadratic inequality ⋮ On Convex Hulls of Epigraphs of QCQPs ⋮ On the tightness of SDP relaxations of QCQPs ⋮ On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations ⋮ Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity ⋮ Invariants of SDP exactness in quadratic programming ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ How to convexify the intersection of a second order cone and a nonconvex quadratic ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ The generalized trust region subproblem: solution complexity and convex hull results

Uses Software

• JDQR

This page was built for publication: Convex hull of two quadratic constraints is an LMI set