On the exactness of Lasserre relaxations for compact convex basic closed semialgebraic sets

dc.contributor.authorKriel, Tom-Lukas
dc.contributor.authorSchweighofer, Markus
dc.date.accessioned2017-05-05T13:33:43Z
dc.date.available2017-05-05T13:33:43Z
dc.date.issued2017-04-24T13:50:50Zeng
dc.description.abstractConsider a finite system of non-strict real polynomial inequalities and suppose its solution set S⊆Rn is convex, has nonempty interior and is compact. Suppose that the system satisfies the Archimedean condition, which is slightly stronger than the compactness of S. Suppose that each defining polynomial satisfies a second order strict quasiconcavity condition where it vanishes on S (which is very natural because of the convexity of S) or its Hessian has a certain matrix sums of squares certificate for negative-semidefiniteness on S (fulfilled trivially by linear polynomials). Then we show that the system possesses an exact Lasserre relaxation.
In their seminal work of 2009, Helton and Nie showed under the same conditions that S is the projection of a spectrahedron, i.e., it has a semidefinite representation. The semidefinite representation used by Helton and Nie arises from glueing together Lasserre relaxations of many small pieces obtained in a non-constructive way. By refining and varying their approach, we show that we can simply take a Lasserre relaxation of the original system itself. Such a result was provided by Helton and Nie with much more machinery only under very technical conditions and after changing the description of S.
eng
dc.description.versionsubmittedeng
dc.identifier.arxiv1704.07231eng
dc.identifier.ppn488270383
dc.identifier.urihttps://kops.uni-konstanz.de/handle/123456789/38753
dc.language.isoengeng
dc.rightsterms-of-use
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/
dc.subjectmoment relaxation, Lasserre relaxation, basic closed semialgebraic set, sum of squares, polynomial optimization, semidefinite programming, linear matrix inequality, spectrahedron, semidefinitely representable seteng
dc.subject.ddc510eng
dc.subject.mscPrimary 14P10, 52A20; Secondary 13J30, 52A41, 90C22, 90C26
dc.titleOn the exactness of Lasserre relaxations for compact convex basic closed semialgebraic setseng
dc.typeWORKINGPAPEReng
dspace.entity.typePublication
kops.description.openAccessopenaccessgreen
kops.flag.knbibliographytrue
kops.identifier.nbnurn:nbn:de:bsz:352-0-406718
temp.submission.doi
temp.submission.source

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Lade...
Vorschaubild
Name:
Kriel_0-406718.pdf
Größe:
298.19 KB
Format:
Adobe Portable Document Format
Beschreibung:
Kriel_0-406718.pdf
Kriel_0-406718.pdfGröße: 298.19 KBDownloads: ?

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
license.txt
Größe:
3.88 KB
Format:
Item-specific license agreed upon to submission
Beschreibung:
license.txt
license.txtGröße: 3.88 KBDownloads: 0

Versionsgeschichte

Gerade angezeigt 1 - 2 von 2
VersionDatumZusammenfassung
2018-07-18 07:15:17
1*
2017-05-05 13:33:43
* Ausgewählte Version