## A dynamical systems approach to constrained minimization

1999
##### Series
Konstanzer Schriften in Mathematik und Informatik; 89
Preprint
##### Abstract
We present an ordinary differential equations approach to solve general smooth minimization problems including a convergence analysis. Generically often the procedure ends up at a point which fulfills sufficient conditions for a local minimum. This procedure will then be rewritten in the concept of differential algebraic equations which opens the route to an efficient implementation. Furthermore, we link this approach with the classical SQP-approach and apply both techniques onto two examples relevant in applications.
510 Mathematics
##### Cite This
ISO 690SCHROPP, Johannes, 1999. A dynamical systems approach to constrained minimization
BibTex
@unpublished{Schropp1999dynam-708,
year={1999},
title={A dynamical systems approach to constrained minimization},
author={Schropp, Johannes}
}

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/708">
<dc:creator>Schropp, Johannes</dc:creator>
<dc:format>application/pdf</dc:format>
<dcterms:issued>1999</dcterms:issued>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/708/1/preprint_089.pdf"/>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/708/1/preprint_089.pdf"/>
<dc:language>eng</dc:language>
<dc:rights>terms-of-use</dc:rights>
<dcterms:title>A dynamical systems approach to constrained minimization</dcterms:title>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/708"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-22T17:45:35Z</dc:date>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-22T17:45:35Z</dcterms:available>
<dcterms:abstract xml:lang="eng">We present an ordinary differential equations approach to solve general smooth minimization problems including a convergence analysis. Generically often the procedure ends up at a point which fulfills sufficient conditions for a local minimum. This procedure will then be rewritten in the concept of differential algebraic equations which opens the route to an efficient implementation. Furthermore, we link this approach with the classical SQP-approach and apply both techniques onto two examples relevant in applications.</dcterms:abstract>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dc:contributor>Schropp, Johannes</dc:contributor>
</rdf:Description>
</rdf:RDF>

Yes