On the complexity of Putinar's Positivstellensatz

Cite This

Files in this item

Checksum: MD5:6e63f6b22db05df41407f0d1dfd4aca1

NIE, Jiawang, Markus SCHWEIGHOFER, 2007. On the complexity of Putinar's Positivstellensatz. In: Journal of Complexity. 23(1), pp. 135-150. ISSN 0885-064X. Available under: doi: 10.1016/j.jco.2006.07.002

@article{Nie2007compl-15643, title={On the complexity of Putinar's Positivstellensatz}, year={2007}, doi={10.1016/j.jco.2006.07.002}, number={1}, volume={23}, issn={0885-064X}, journal={Journal of Complexity}, pages={135--150}, author={Nie, Jiawang and Schweighofer, Markus} }

<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/15643"> <dc:contributor>Schweighofer, Markus</dc:contributor> <dc:contributor>Nie, Jiawang</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/15643/2/putcompl.pdf"/> <dcterms:issued>2007</dcterms:issued> <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> <dcterms:bibliographicCitation>First publ. in: Journal of Complexity 23 (2007)1. - S. 135-150</dcterms:bibliographicCitation> <dc:language>eng</dc:language> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/15643"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-10-31T10:17:27Z</dc:date> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-10-31T10:17:27Z</dcterms:available> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dc:rights>terms-of-use</dc:rights> <dc:creator>Schweighofer, Markus</dc:creator> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:creator>Nie, Jiawang</dc:creator> <dcterms:title>On the complexity of Putinar's Positivstellensatz</dcterms:title> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

putcompl.pdf 166

This item appears in the following Collection(s)

Search KOPS


Browse

My Account