Publikation: On the complexity of Putinar's Positivstellensatz
Lade...
Dateien
Datum
2007
Autor:innen
Nie, Jiawang
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
Journal of Complexity. 2007, 23(1), pp. 135-150. ISSN 0885-064X. Available under: doi: 10.1016/j.jco.2006.07.002
Zusammenfassung
We prove an upper bound on the degree complexity of Putinar's Positivstellensatz. This bound is much worse than the one obtained previously for Schmüdgen's Positivstellensatz but it depends on the same parameters. As a consequence, we get information about the convergence rate of Lasserre's procedure for optimization of a polynomial subject to polynomial constraints.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
510 Mathematik
Schlagwörter
Positivstellensatz, complexity, positive polynomial, sum of squares, preordering, moment problem, optimization of polynomials
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
NIE, Jiawang, Markus SCHWEIGHOFER, 2007. On the complexity of Putinar's Positivstellensatz. In: Journal of Complexity. 2007, 23(1), pp. 135-150. ISSN 0885-064X. Available under: doi: 10.1016/j.jco.2006.07.002BibTex
@article{Nie2007compl-15643,
year={2007},
doi={10.1016/j.jco.2006.07.002},
title={On the complexity of Putinar's Positivstellensatz},
number={1},
volume={23},
issn={0885-064X},
journal={Journal of Complexity},
pages={135--150},
author={Nie, Jiawang and Schweighofer, Markus}
}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/15643">
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-10-31T10:17:27Z</dc:date>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/15643/2/putcompl.pdf"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/15643"/>
<dc:rights>terms-of-use</dc:rights>
<dcterms:issued>2007</dcterms:issued>
<dc:language>eng</dc:language>
<dc:contributor>Nie, Jiawang</dc:contributor>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dc:contributor>Schweighofer, Markus</dc:contributor>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/15643/2/putcompl.pdf"/>
<dcterms:abstract xml:lang="eng">We prove an upper bound on the degree complexity of Putinar's Positivstellensatz. This bound is much worse than the one obtained previously for Schmüdgen's Positivstellensatz but it depends on the same parameters. As a consequence, we get information about the convergence rate of Lasserre's procedure for optimization of a polynomial subject to polynomial constraints.</dcterms:abstract>
<dc:creator>Schweighofer, Markus</dc:creator>
<dc:creator>Nie, Jiawang</dc:creator>
<dcterms:bibliographicCitation>First publ. in: Journal of Complexity 23 (2007)1. - S. 135-150</dcterms:bibliographicCitation>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dcterms:title>On the complexity of Putinar's Positivstellensatz</dcterms:title>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-10-31T10:17:27Z</dcterms:available>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
