Lower Bound Functions for Polynomials

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

Lower Bound Functions for Polynomials

Dateien

preprint_185.pdfGröße: 522.05 KBDownloads: 254

Datum

2003

Autor:innen

Garloff, Jürgen

Jansson, Christian

Smith, Andrew Paul

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Preprint

Publikationsstatus

Published

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

Zitieren

ISO 690

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

BibTex

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

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/6143">
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:47Z</dcterms:available>
    <dc:contributor>Jansson, Christian</dc:contributor>
    <dc:rights>terms-of-use</dc:rights>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:title>Lower Bound Functions for Polynomials</dcterms:title>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:issued>2003</dcterms:issued>
    <dc:format>application/pdf</dc:format>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6143"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6143/1/preprint_185.pdf"/>
    <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>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6143/1/preprint_185.pdf"/>
    <dc:creator>Garloff, Jürgen</dc:creator>
    <dc:creator>Smith, Andrew Paul</dc:creator>
    <dc:creator>Jansson, Christian</dc:creator>
    <dc:language>eng</dc:language>
    <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>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Smith, Andrew Paul</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja