<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
         xmlns:dc="http://purl.org/dc/terms/"
         xmlns:foaf="http://xmlns.com/foaf/0.1/"
         xmlns:bibo="http://purl.org/ontology/bibo/"
         xmlns:fabio="http://purl.org/spar/fabio/"
         xmlns:owl="http://www.w3.org/2002/07/owl#"
         xmlns:event="http://purl.org/NET/c4dm/event.owl#"
         xmlns:ore="http://www.openarchives.org/ore/terms/">

    <rdf:Description rdf:about="https://ris.uni-paderborn.de/record/8757">
        <ore:isDescribedBy rdf:resource="https://ris.uni-paderborn.de/record/8757"/>
        <dc:title>POD-based multiobjective optimal control of PDEs with non-smooth objectives</dc:title>
        <bibo:authorList rdf:parseType="Collection">
            <foaf:Person>
                <foaf:name></foaf:name>
                <foaf:surname></foaf:surname>
                <foaf:givenname></foaf:givenname>
            </foaf:Person>
            <foaf:Person>
                <foaf:name></foaf:name>
                <foaf:surname></foaf:surname>
                <foaf:givenname></foaf:givenname>
            </foaf:Person>
            <foaf:Person>
                <foaf:name></foaf:name>
                <foaf:surname></foaf:surname>
                <foaf:givenname></foaf:givenname>
            </foaf:Person>
            <foaf:Person>
                <foaf:name></foaf:name>
                <foaf:surname></foaf:surname>
                <foaf:givenname></foaf:givenname>
            </foaf:Person>
        </bibo:authorList>
        <bibo:abstract>A framework for set‐oriented multiobjective optimal control of partial differential equations using reduced order modeling has recently been developed [1]. Following concepts from localized reduced bases methods, error estimators for the reduced cost functionals are utilized to construct a library of locally valid reduced order models. This way, a superset of the Pareto set can efficiently be computed while maintaining a prescribed error bound. In this article, this algorithm is applied to a problem with non‐smooth objective functionals. Using an academic example, we show that the extension to non‐smooth problems can be realized in a straightforward manner. We then discuss the implications on the numerical results.</bibo:abstract>
        <bibo:startPage>51-54</bibo:startPage>
        <bibo:endPage>51-54</bibo:endPage>
        <bibo:doi rdf:resource="10.1002/pamm.201710015" />
        <ore:similarTo rdf:resource="info:doi/10.1002/pamm.201710015"/>
    </rdf:Description>
</rdf:RDF>
