Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
We investigate exact semidefinite programming (SDP) relaxations for the problem of minimizing a nonconvex quadratic objective function over a feasible region defined by both finitely and infinitely many nonconvex quadratic inequality constraints (semi-infinite QCQPs). Sufficient conditions for the exactness of SDP relaxations for QCQPs with finitely many constraints have been extensively studied, notably by Argue … Read more