Naohiko Arima

Exact SDP Relaxations for a Class of Quadratic Programs with Finite and Infinite Quadratic Constraints

Abstract. 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). S...