Publikation:

Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction

Lade...
Vorschaubild

Dateien

Quijorna_2-1ktc63y0g4pg84.pdf
Quijorna_2-1ktc63y0g4pg84.pdfGröße: 597.14 KBDownloads: 45

Datum

2021

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
Open Access Hybrid
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published

Erschienen in

Journal of Global Optimization. Springer Science. 2021, 81, pp. 559-598. ISSN 0925-5001. eISSN 1573-2916. Available under: doi: 10.1007/s10898-020-00987-9

Zusammenfassung

A basic closed semialgebraic subset of Rn is defined by simultaneous polynomial inequalities p1≥0,…,pm≥0. We consider Lasserre’s relaxation hierarchy to solve the problem of minimizing a polynomial over such a set. These relaxations give an increasing sequence of lower bounds of the infimum. In this paper we provide a new certificate for the optimal value of a Lasserre relaxation to be the optimal value of the polynomial optimization problem. This certificate is to check if a certain matrix has a generalized Hankel form. This certificate is more general than the already known certificate of an optimal solution being flat. In case we have detected optimality we will extract the potential minimizers with a truncated version of the Gelfand–Naimark–Segal construction on the optimal solution of the Lasserre relaxation. We prove also that the operators of this truncated construction commute if and only if the matrix of this modified optimal solution is a generalized Hankel matrix. This generalization of flatness will enable us to prove, with the use of the GNS truncated construction, a result of Curto and Fialkow on the existence of quadrature rule if the optimal solution is flat and a result of Xu and Mysovskikh on the existence of a Gaussian quadrature rule if the modified optimal solution is a generalized Hankel matrix . At the end, we provide a numerical linear algebraic algorithm for detecting optimality and extracting solutions of a polynomial optimization problem.

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 690LOPEZ QUIJORNA, Maria, 2021. Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction. In: Journal of Global Optimization. Springer Science. 2021, 81, pp. 559-598. ISSN 0925-5001. eISSN 1573-2916. Available under: doi: 10.1007/s10898-020-00987-9
BibTex
@article{LopezQuijorna2021Detec-53432,
  year={2021},
  doi={10.1007/s10898-020-00987-9},
  title={Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction},
  volume={81},
  issn={0925-5001},
  journal={Journal of Global Optimization},
  pages={559--598},
  author={Lopez Quijorna, Maria},
  note={Preprint in KOPS veröffentlicht: http://kops.uni-konstanz.de/handle/123456789/38689}
}
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/53432">
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:rights>terms-of-use</dc:rights>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:title>Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction</dcterms:title>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/53432/1/Quijorna_2-1ktc63y0g4pg84.pdf"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-04-21T13:42:45Z</dcterms:available>
    <dc:creator>Lopez Quijorna, Maria</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dc:language>eng</dc:language>
    <dcterms:abstract xml:lang="eng">A basic closed semialgebraic subset of Rn is defined by simultaneous polynomial inequalities p1≥0,…,pm≥0. We consider Lasserre’s relaxation hierarchy to solve the problem of minimizing a polynomial over such a set. These relaxations give an increasing sequence of lower bounds of the infimum. In this paper we provide a new certificate for the optimal value of a Lasserre relaxation to be the optimal value of the polynomial optimization problem. This certificate is to check if a certain matrix has a generalized Hankel form. This certificate is more general than the already known certificate of an optimal solution being flat. In case we have detected optimality we will extract the potential minimizers with a truncated version of the Gelfand–Naimark–Segal construction on the optimal solution of the Lasserre relaxation. We prove also that the operators of this truncated construction commute if and only if the matrix of this modified optimal solution is a generalized Hankel matrix. This generalization of flatness will enable us to prove, with the use of the GNS truncated construction, a result of Curto and Fialkow on the existence of quadrature rule if the optimal solution is flat and a result of Xu and Mysovskikh on the existence of a Gaussian quadrature rule if the modified optimal solution is a generalized Hankel matrix . At the end, we provide a numerical linear algebraic algorithm for detecting optimality and extracting solutions of a polynomial optimization problem.</dcterms:abstract>
    <dc:contributor>Lopez Quijorna, Maria</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-04-21T13:42:45Z</dc:date>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/53432/1/Quijorna_2-1ktc63y0g4pg84.pdf"/>
    <dcterms:issued>2021</dcterms:issued>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/53432"/>
  </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

Preprint in KOPS veröffentlicht: http://kops.uni-konstanz.de/handle/123456789/38689
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Ja
Diese Publikation teilen