摘要

We consider semidefinite, copositive, and more general, set-semidefinite programming relaxations of general nonconvex quadratic problems. For the semidefinite case a comparison between the feasible set of the original program and the feasible set of the relaxation has been given by Kojima and Tun double dagger el (SIAM J Optim 10(3):750-778, 2000). In this paper the comparison is presented for set-positive relaxations which contain copositive relaxations as a special case.

  • 出版日期2013-12

全文