Lower Bound Functions for Polynomials

Garloff, Jürgen; Jansson, Christian; Smith, Andrew Paul

Lower Bound Functions for Polynomials

Publikationstyp:	Preprint
URI (zitierfähiger Link):	http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-22123
Autor/innen:	Garloff, Jürgen; Jansson, Christian; Smith, Andrew Paul
Erscheinungsjahr:	2003
Schriftenreihe:	Konstanzer Schriften in Mathematik und Informatik ; 185
Zusammenfassung:	Relaxation techniques for solving nonlinear systems and global optimisation problems require bounding from below the nonconvexities that occur in the constraints or in the objective function by affine or convex functions. In this paper we consider such lower bound functions in the case of problems involving multivariate polynomials. They are constructed by using Bernstein expansion. An error bound exhibiting quadratic convergence in the univariate case and some numerical examples are given.
Fachgebiet (DDC):	004 Informatik
Link zur Lizenz:	Nutzungsbedingungen
Universitätsbibliographie:	Ja

Zitieren

Dateien zu dieser Ressource

Name: preprint_185.pdf

Größe: 522.0Kb

Format: PDF

Öffnen

Prüfsumme: MD5:e4b72fa8e9f6ac65599f97be36d301d9

GARLOFF, Jürgen, Christian JANSSON, Andrew Paul SMITH, 2003. Lower Bound Functions for Polynomials

@unpublished{Garloff2003Lower-6143, title={Lower Bound Functions for Polynomials}, year={2003}, author={Garloff, Jürgen and Jansson, Christian and Smith, Andrew Paul} }

<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/6143"> <dc:contributor>Smith, Andrew Paul</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:47Z</dc:date> <dc:contributor>Garloff, Jürgen</dc:contributor> <dc:creator>Smith, Andrew Paul</dc:creator> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6143/1/preprint_185.pdf"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6143"/> <dc:contributor>Jansson, Christian</dc:contributor> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6143/1/preprint_185.pdf"/> <dcterms:issued>2003</dcterms:issued> <dc:format>application/pdf</dc:format> <dc:rights>terms-of-use</dc:rights> <dcterms:rights rdf:resource="https://kops.uni-konstanz.de/page/termsofuse"/> <dcterms:title>Lower Bound Functions for Polynomials</dcterms:title> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:47Z</dcterms:available> <dcterms:abstract xml:lang="eng">Relaxation techniques for solving nonlinear systems and global optimisation problems require bounding from below the nonconvexities that occur in the constraints or in the objective function by affine or convex functions. In this paper we consider such lower bound functions in the case of problems involving multivariate polynomials. They are constructed by using Bernstein expansion. An error bound exhibiting quadratic convergence in the univariate case and some numerical examples are given.</dcterms:abstract> <dc:creator>Jansson, Christian</dc:creator> <dc:language>eng</dc:language> <dc:creator>Garloff, Jürgen</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> </rdf:Description> </rdf:RDF>