A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces

Kurzanzeige
dc.contributor.authorSonntag, Konstantin
dc.contributor.authorGebken, Bennet
dc.contributor.authorMüller, Georg
dc.contributor.authorPeitz, Sebastian
dc.contributor.authorVolkwein, Stefan
dc.date.accessioned2024-09-19T07:06:26Z
dc.date.available2024-09-19T07:06:26Z
dc.date.issued2024-10
dc.description.abstractThe efficient optimization method for locally Lipschitz continuous multiobjective optimization problems from Gebken and Peitz (J Optim Theory Appl 188:696–723, 2021) is extended from finite-dimensional problems to general Hilbert spaces. The method iteratively computes Pareto critical points, where in each iteration, an approximation of the Clarke subdifferential is computed in an efficient manner and then used to compute a common descent direction for all objective functions. To prove convergence, we present some new optimality results for nonsmooth multiobjective optimization problems in Hilbert spaces. Using these, we can show that every accumulation point of the sequence generated by our algorithm is Pareto critical under common assumptions. Computational efficiency for finding Pareto critical points is numerically demonstrated for multiobjective optimal control of an obstacle problem.
dc.description.versionpublisheddeu
dc.identifier.doi10.1007/s10957-024-02520-4
dc.identifier.ppn1911807072
dc.identifier.urihttps://kops.uni-konstanz.de/handle/123456789/70815
dc.language.isoeng
dc.rightsAttribution 4.0 International
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.subject.ddc510
dc.titleA Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaceseng
dc.typeJOURNAL_ARTICLE
dspace.entity.typePublication
kops.citation.bibtex
@article{Sonntag2024-10Desce-70815,
  year={2024},
  doi={10.1007/s10957-024-02520-4},
  title={A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces},
  number={1},
  volume={203},
  issn={0022-3239},
  journal={Journal of Optimization Theory and Applications},
  pages={455--487},
  author={Sonntag, Konstantin and Gebken, Bennet and Müller, Georg and Peitz, Sebastian and Volkwein, Stefan}
}
kops.citation.iso690SONNTAG, Konstantin, Bennet GEBKEN, Georg MÜLLER, Sebastian PEITZ, Stefan VOLKWEIN, 2024. A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces. In: Journal of Optimization Theory and Applications. Springer. 2024, 203(1), S. 455-487. ISSN 0022-3239. eISSN 1573-2878. Verfügbar unter: doi: 10.1007/s10957-024-02520-4deu
kops.citation.iso690SONNTAG, Konstantin, Bennet GEBKEN, Georg MÜLLER, Sebastian PEITZ, Stefan VOLKWEIN, 2024. A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces. In: Journal of Optimization Theory and Applications. Springer. 2024, 203(1), pp. 455-487. ISSN 0022-3239. eISSN 1573-2878. Available under: doi: 10.1007/s10957-024-02520-4eng
kops.citation.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/70815">
    <dcterms:title>A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2024-09-19T07:06:26Z</dc:date>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dc:contributor>Müller, Georg</dc:contributor>
    <dc:language>eng</dc:language>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/70815/1/Sonntag_2-w3rd22i3ot8u0.PDF"/>
    <dc:creator>Volkwein, Stefan</dc:creator>
    <dc:creator>Peitz, Sebastian</dc:creator>
    <dc:contributor>Sonntag, Konstantin</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/70815"/>
    <dc:rights>Attribution 4.0 International</dc:rights>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Müller, Georg</dc:creator>
    <dc:creator>Gebken, Bennet</dc:creator>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/"/>
    <dc:contributor>Gebken, Bennet</dc:contributor>
    <dcterms:issued>2024-10</dcterms:issued>
    <dc:contributor>Volkwein, Stefan</dc:contributor>
    <dc:creator>Sonntag, Konstantin</dc:creator>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Peitz, Sebastian</dc:contributor>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/70815/1/Sonntag_2-w3rd22i3ot8u0.PDF"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2024-09-19T07:06:26Z</dcterms:available>
    <dcterms:abstract>The efficient optimization method for locally Lipschitz continuous multiobjective optimization problems from Gebken and Peitz (J Optim Theory Appl 188:696–723, 2021) is extended from finite-dimensional problems to general Hilbert spaces. The method iteratively computes Pareto critical points, where in each iteration, an approximation of the Clarke subdifferential is computed in an efficient manner and then used to compute a common descent direction for all objective functions. To prove convergence, we present some new optimality results for nonsmooth multiobjective optimization problems in Hilbert spaces. Using these, we can show that every accumulation point of the sequence generated by our algorithm is Pareto critical under common assumptions. Computational efficiency for finding Pareto critical points is numerically demonstrated for multiobjective optimal control of an obstacle problem.</dcterms:abstract>
  </rdf:Description>
</rdf:RDF>
kops.description.openAccessopenaccesshybrid
kops.flag.isPeerReviewedtrue
kops.flag.knbibliographytrue
kops.identifier.nbnurn:nbn:de:bsz:352-2-w3rd22i3ot8u0
kops.sourcefieldJournal of Optimization Theory and Applications. Springer. 2024, <b>203</b>(1), S. 455-487. ISSN 0022-3239. eISSN 1573-2878. Verfügbar unter: doi: 10.1007/s10957-024-02520-4deu
kops.sourcefield.plainJournal of Optimization Theory and Applications. Springer. 2024, 203(1), S. 455-487. ISSN 0022-3239. eISSN 1573-2878. Verfügbar unter: doi: 10.1007/s10957-024-02520-4deu
kops.sourcefield.plainJournal of Optimization Theory and Applications. Springer. 2024, 203(1), pp. 455-487. ISSN 0022-3239. eISSN 1573-2878. Available under: doi: 10.1007/s10957-024-02520-4eng
relation.isAuthorOfPublication88debcaa-8c0d-49d8-9ee7-5837fef964fa
relation.isAuthorOfPublication1331ea51-1e11-44de-851e-280a04907915
relation.isAuthorOfPublication.latestForDiscovery88debcaa-8c0d-49d8-9ee7-5837fef964fa
source.bibliographicInfo.fromPage455
source.bibliographicInfo.issue1
source.bibliographicInfo.toPage487
source.bibliographicInfo.volume203
source.identifier.eissn1573-2878
source.identifier.issn0022-3239
source.periodicalTitleJournal of Optimization Theory and Applications
source.publisherSpringer

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
Sonntag_2-w3rd22i3ot8u0.PDF
Größe:
1.48 MB
Format:
Adobe Portable Document Format
Sonntag_2-w3rd22i3ot8u0.PDF
Sonntag_2-w3rd22i3ot8u0.PDFGröße: 1.48 MBDownloads: 104

Sammlungen

Mathematik und Statistik: Publikationen