The geometry of SDP-exactness in quadratic optimization

dc.date.accessioned	2020-06-19T18:47:04Z
dc.date.available	2020-06-19T18:47:04Z
dc.date.created	2019-11-18T15:26:41Z
dc.date.issued	2019
dc.identifier.citation	Cifuentes, Diego Harris, Corey Sturmfels, Bernd . The geometry of SDP-exactness in quadratic optimization. Mathematical programming. 2019, 1-30
dc.identifier.uri	http://hdl.handle.net/10852/77082
dc.description.abstract	Consider the problem of minimizing a quadratic objective subject to quadratic equations. We study the semialgebraic region of objective functions for which this problem is solved by its semidefinite relaxation. For the Euclidean distance problem, this is a bundle of spectrahedral shadows surrounding the given variety. We characterize the algebraic boundary of this region and we derive a formula for its degree.
dc.language	EN
dc.rights	Attribution 4.0 International
dc.rights.uri	https://creativecommons.org/licenses/by/4.0/
dc.title	The geometry of SDP-exactness in quadratic optimization
dc.type	Journal article
dc.creator.author	Cifuentes, Diego
dc.creator.author	Harris, Corey
dc.creator.author	Sturmfels, Bernd
cristin.unitcode	185,15,13,0
cristin.unitname	Matematisk institutt
cristin.ispublished	true
cristin.fulltext	original
cristin.qualitycode	2
dc.identifier.cristin	1748982
dc.identifier.bibliographiccitation	info:ofi/fmt:kev:mtx:ctx&ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Mathematical programming&rft.volume=&rft.spage=1&rft.date=2019
dc.identifier.jtitle	Mathematical programming
dc.identifier.startpage	1
dc.identifier.endpage	30
dc.identifier.doi	https://doi.org/10.1007/s10107-019-01399-8
dc.identifier.urn	URN:NBN:no-80213
dc.type.document	Tidsskriftartikkel
dc.type.peerreviewed	Peer reviewed
dc.source.issn	0025-5610
dc.identifier.fulltext	Fulltext https://www.duo.uio.no/bitstream/handle/10852/77082/2/Cifuentes2019_Article_TheGeometryOfSDP-exactnessInQu.pdf
dc.type.version	PublishedVersion