KOPS - The Institutional Repository of the University of Konstanz

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

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

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

LOPEZ QUIJORNA, Maria, 2021. Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction. In: Journal of Global Optimization. Springer Science. ISSN 0925-5001. eISSN 1573-2916. Available under: doi: 10.1007/s10898-020-00987-9

@article{LopezQuijorna2021Detec-53432, title={Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction}, year={2021}, doi={10.1007/s10898-020-00987-9}, issn={0925-5001}, journal={Journal of Global Optimization}, author={Lopez Quijorna, Maria}, note={Preprint in KOPS veröffentlicht: http://kops.uni-konstanz.de/handle/123456789/38689} }

<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/rdf/resource/123456789/53432"> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/53432"/> <dc:language>eng</dc:language> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <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> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-04-21T13:42:45Z</dcterms:available> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-04-21T13:42:45Z</dc:date> <dc:contributor>Lopez Quijorna, Maria</dc:contributor> <dcterms:title>Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction</dcterms:title> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dcterms:issued>2021</dcterms:issued> <dc:creator>Lopez Quijorna, Maria</dc:creator> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account