--- res: bibo_abstract: - In this article we propose a descent method for equality and inequality constrained multiobjective optimization problems (MOPs) which generalizes the steepest descent method for unconstrained MOPs by Fliege and Svaiter to constrained problems by using two active set strategies. Under some regularity assumptions on the problem, we show that accumulation points of our descent method satisfy a necessary condition for local Pareto optimality. Finally, we show the typical behavior of our method in a numerical example.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Bennet foaf_name: Gebken, Bennet foaf_surname: Gebken foaf_workInfoHomepage: http://www.librecat.org/personId=32643 - foaf_Person: foaf_givenName: Sebastian foaf_name: Peitz, Sebastian foaf_surname: Peitz foaf_workInfoHomepage: http://www.librecat.org/personId=47427 orcid: https://orcid.org/0000-0002-3389-793X - foaf_Person: foaf_givenName: Michael foaf_name: Dellnitz, Michael foaf_surname: Dellnitz bibo_doi: 10.1007/978-3-319-96104-0_2 dct_date: 2018^xs_gYear dct_isPartOf: - http://id.crossref.org/issn/1860-949X - http://id.crossref.org/issn/1860-9503 - http://id.crossref.org/issn/9783319961033 - http://id.crossref.org/issn/9783319961040 dct_language: eng dct_title: A Descent Method for Equality and Inequality Constrained Multiobjective Optimization Problems@ ...