Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Springer in its journal Journal of Global Optimization.
Volume (Year): 50 (2011)
Issue (Month): 4 (August)
Contact details of provider:
Web page: http://www.springer.com/business/operations+research/journal/10898
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Bomze, I.M. & Dür, M. & Klerk, E. de & Roos, C. & Quist, A.J. & Terlaky, T., 2000. "On copositive programming and standard quadratic optimization problems," Open Access publications from Tilburg University urn:nbn:nl:ui:12-226128, Tilburg University.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.