KOPS - The Institutional Repository of the University of Konstanz

ROM-based inexact subdivision methods for PDE-constrained multiobjective optimization

ROM-based inexact subdivision methods for PDE-constrained multiobjective optimization

Cite This

Files in this item

Checksum: MD5:5eaf5b259430bee2626c26565c5d8da3

BANHOLZER, Stefan, Bennet GEBKEN, Lena REICHLE, Stefan VOLKWEIN, 2021. ROM-based inexact subdivision methods for PDE-constrained multiobjective optimization. In: Mathematical and Computational Applications. MDPI. 26(2), 32. ISSN 2297-8747. eISSN 1300-686X. Available under: doi: 10.3390/mca26020032

@article{Banholzer2021ROMba-52995.2, title={ROM-based inexact subdivision methods for PDE-constrained multiobjective optimization}, year={2021}, doi={10.3390/mca26020032}, number={2}, volume={26}, issn={2297-8747}, journal={Mathematical and Computational Applications}, author={Banholzer, Stefan and Gebken, Bennet and Reichle, Lena and Volkwein, Stefan}, note={Article Number: 32} }

<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/52995.2"> <dcterms:abstract xml:lang="eng">The goal in multiobjective optimization is to determine the so-called Pareto set. Our optimization problem is governed by a parameter dependent semilinear elliptic partial differential equation (PDE). To solve it, we use a gradient based set-oriented numerical method. The numerical solution of the PDE by standard discretization methods usually leads to high computational effort. To overcome this difficulty, reduced-order modeling (ROM) is developed utilizing the reduced basis method. These model simplifications cause inexactness in the gradients. For that reason, an additional descent condition is proposed. Applying a modified subdivision algorithm, numerical experiments illustrate the efficiency of our solution approach.</dcterms:abstract> <dc:creator>Reichle, Lena</dc:creator> <dcterms:title>ROM-based inexact subdivision methods for PDE-constrained multiobjective optimization</dcterms:title> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/52995.2/1/Banholzer_2-1tlwgrxeiaqr10.pdf"/> <dc:creator>Gebken, Bennet</dc:creator> <dc:contributor>Banholzer, Stefan</dc:contributor> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:rights>terms-of-use</dc:rights> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Volkwein, Stefan</dc:creator> <dc:contributor>Volkwein, Stefan</dc:contributor> <dc:contributor>Gebken, Bennet</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-05-05T11:09:03Z</dcterms:available> <dc:language>eng</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Banholzer, Stefan</dc:creator> <dcterms:issued>2021</dcterms:issued> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-05-05T11:09:03Z</dc:date> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/52995.2"/> <dc:contributor>Reichle, Lena</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/52995.2/1/Banholzer_2-1tlwgrxeiaqr10.pdf"/> </rdf:Description> </rdf:RDF>

Downloads since May 5, 2021 (Information about access statistics)

Banholzer_2-1tlwgrxeiaqr10.pdf 21

This item appears in the following Collection(s)

Version History

Version Item Date Summary Publication Version

*Selected version

Search KOPS


Browse

My Account