Publikation:

Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization

Lade...
Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2013

Autor:innen

Theobald, Thorsten
Jansson Andrén, Lina
Lasserre, Jean B.

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published

Erschienen in

Mathematics of Operations Research. 2013, 38(1), pp. 122-141. ISSN 0364-765X. eISSN 1526-5471. Available under: doi: 10.1287/moor.1120.0558

Zusammenfassung

In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semidefinite programming relaxations. Our special focus is on constrained problems especially when the symmetric group is acting on the variables. In particular, we investigate the concept of block decomposition within the framework of constrained polynomial optimization problems, show how the degree principle for the symmetric group can be computationally exploited, and also propose some methods to efficiently compute the geometric quotient.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
510 Mathematik

Schlagwörter

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690RIENER, Cordian, Thorsten THEOBALD, Lina JANSSON ANDRÉN, Jean B. LASSERRE, 2013. Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization. In: Mathematics of Operations Research. 2013, 38(1), pp. 122-141. ISSN 0364-765X. eISSN 1526-5471. Available under: doi: 10.1287/moor.1120.0558
BibTex
@article{Riener2013Explo-23503,
  year={2013},
  doi={10.1287/moor.1120.0558},
  title={Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization},
  number={1},
  volume={38},
  issn={0364-765X},
  journal={Mathematics of Operations Research},
  pages={122--141},
  author={Riener, Cordian and Theobald, Thorsten and Jansson Andrén, Lina and Lasserre, Jean B.}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/23503">
    <dcterms:title>Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization</dcterms:title>
    <dc:creator>Jansson Andrén, Lina</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dcterms:issued>2013</dcterms:issued>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23503"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <dcterms:bibliographicCitation>Mathematics of Operations Research ; 38 (2013), 1. - S. 122-141</dcterms:bibliographicCitation>
    <dc:creator>Theobald, Thorsten</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-06-10T12:57:54Z</dcterms:available>
    <dc:creator>Lasserre, Jean B.</dc:creator>
    <dc:language>eng</dc:language>
    <dc:contributor>Riener, Cordian</dc:contributor>
    <dc:rights>terms-of-use</dc:rights>
    <dc:creator>Riener, Cordian</dc:creator>
    <dc:contributor>Lasserre, Jean B.</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52"/>
    <dc:contributor>Theobald, Thorsten</dc:contributor>
    <dc:contributor>Jansson Andrén, Lina</dc:contributor>
    <dcterms:abstract xml:lang="eng">In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semidefinite programming relaxations. Our special focus is on constrained problems especially when the symmetric group is acting on the variables. In particular, we investigate the concept of block decomposition within the framework of constrained polynomial optimization problems, show how the degree principle for the symmetric group can be computationally exploited, and also propose some methods to efficiently compute the geometric quotient.</dcterms:abstract>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-06-10T12:57:54Z</dc:date>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen