A note on set-semidefinite relaxations of nonconvex quadratic programs

Faizan Ahmed and Georg Still ()

Journal of Global Optimization, 2013, vol. 57, issue 4, 1139-1146

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. Copyright Springer Science+Business Media New York 2013

Keywords: Quadratic programs; Semidefinite-; Copositive- and Set-positive relaxations; 90C20; 90C22; 90C09 (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-012-0013-2 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:57:y:2013:i:4:p:1139-1146

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-012-0013-2

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().