Abstract
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ç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.
Original language | Undefined |
---|---|
Pages (from-to) | 1139-1146 |
Number of pages | 8 |
Journal | Journal of global optimization |
Volume | 57 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2013 |
Keywords
- EWI-23986
- Quadratic programs
- IR-87881
- semidefinite-
- METIS-300165
- copositive- and set-positive relaxations