<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using Inexact Gradients</dc:title>
   	<dc:creator>Berkemeier, Manuel Bastian</dc:creator>
   	<dc:creator>Peitz, Sebastian</dc:creator>
   	<dc:description>In this article, we build on previous work to present an optimization algorithm for nonlinearly constrained multi-objective optimization problems. The algorithm combines a surrogate-assisted derivative-free trust-region approach with the filter method known from single-objective optimization. Instead of the true objective and constraint functions, so-called fully linear models are employed and we show how to deal with the gradient inexactness in the composite step setting, adapted from single-objective optimization as well. Under standard assumptions, we prove convergence of a subset of iterates to a quasi-stationary point and if constraint qualifications hold, then the limit point is also a KKT-point of the multi-objective problem.</dc:description>
   	<dc:date>2022</dc:date>
   	<dc:type>info:eu-repo/semantics/preprint</dc:type>
   	<dc:type>doc-type:preprint</dc:type>
   	<dc:type>text</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_816b</dc:type>
   	<dc:identifier>https://ris.uni-paderborn.de/record/33150</dc:identifier>
   	<dc:source>Berkemeier MB, Peitz S. Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using Inexact Gradients. &lt;i&gt;arXiv:220812094&lt;/i&gt;. Published online 2022.</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/arxiv/2208.12094</dc:relation>
   	<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
