{"id":"https://openalex.org/W4417128801","doi":"https://doi.org/10.5802/ojmo.47","title":"Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using Inexact Gradients","display_name":"Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using Inexact Gradients","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W4417128801","doi":"https://doi.org/10.5802/ojmo.47"},"language":"en","primary_location":{"id":"doi:10.5802/ojmo.47","is_oa":true,"landing_page_url":"https://doi.org/10.5802/ojmo.47","pdf_url":"https://ojmo.centre-mersenne.org/item/10.5802/ojmo.47.pdf","source":{"id":"https://openalex.org/S4210238298","display_name":"Open Journal of Mathematical Optimization","issn_l":"2777-5860","issn":["2777-5860"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310311164","host_organization_name":"University of Montpellier","host_organization_lineage":["https://openalex.org/P4310311164"],"host_organization_lineage_names":["University of Montpellier"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Journal of Mathematical Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojmo.centre-mersenne.org/item/10.5802/ojmo.47.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001134145","display_name":"Manuel Berkemeier","orcid":"https://orcid.org/0000-0002-3958-2277"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Manuel Berkemeier","raw_affiliation_strings":["Department of Computer Science, TU Dortmund University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Dortmund University, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049416946","display_name":"Sebastian Peitz","orcid":"https://orcid.org/0000-0002-3389-793X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Peitz","raw_affiliation_strings":["Department of Computer Science, TU Dortmund University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Dortmund University, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43855721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"1","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.5871000289916992,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.5871000289916992,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.1808999925851822,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.05079999938607216,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6359000205993652},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6078000068664551},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5950000286102295},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5349000096321106},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.5293999910354614},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.5169000029563904},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.48330000042915344},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.48249998688697815}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6359000205993652},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6078000068664551},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5950000286102295},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5349000096321106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5328999757766724},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.5293999910354614},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.5169000029563904},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5149000287055969},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.48330000042915344},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.48249998688697815},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4796000123023987},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.4641000032424927},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4392000138759613},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.4343000054359436},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4009999930858612},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3871999979019165},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.36469998955726624},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.36410000920295715},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35339999198913574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3450999855995178},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.3125999867916107},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.26649999618530273}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5802/ojmo.47","is_oa":true,"landing_page_url":"https://doi.org/10.5802/ojmo.47","pdf_url":"https://ojmo.centre-mersenne.org/item/10.5802/ojmo.47.pdf","source":{"id":"https://openalex.org/S4210238298","display_name":"Open Journal of Mathematical Optimization","issn_l":"2777-5860","issn":["2777-5860"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310311164","host_organization_name":"University of Montpellier","host_organization_lineage":["https://openalex.org/P4310311164"],"host_organization_lineage_names":["University of Montpellier"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Journal of Mathematical Optimization","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.5802/ojmo.47","is_oa":true,"landing_page_url":"https://doi.org/10.5802/ojmo.47","pdf_url":"https://ojmo.centre-mersenne.org/item/10.5802/ojmo.47.pdf","source":{"id":"https://openalex.org/S4210238298","display_name":"Open Journal of Mathematical Optimization","issn_l":"2777-5860","issn":["2777-5860"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310311164","host_organization_name":"University of Montpellier","host_organization_lineage":["https://openalex.org/P4310311164"],"host_organization_lineage_names":["University of Montpellier"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Open Journal of Mathematical Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3824553112","display_name":"Hybride Modellierung f\u00fcr die datengest\u00fctzte Mehrzieloptimierung von Mehrk\u00f6rpersystemen","funder_award_id":"501834605","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4417128801.pdf","grobid_xml":"https://content.openalex.org/works/W4417128801.grobid-xml"},"referenced_works_count":61,"referenced_works":["https://openalex.org/W147998453","https://openalex.org/W181733065","https://openalex.org/W641771830","https://openalex.org/W1039515204","https://openalex.org/W1451881698","https://openalex.org/W1521048074","https://openalex.org/W1572204513","https://openalex.org/W1964442167","https://openalex.org/W1968496192","https://openalex.org/W1976385924","https://openalex.org/W1992296912","https://openalex.org/W1995202706","https://openalex.org/W1997965167","https://openalex.org/W1998081129","https://openalex.org/W2007294066","https://openalex.org/W2010895984","https://openalex.org/W2030874933","https://openalex.org/W2052471135","https://openalex.org/W2084708846","https://openalex.org/W2091318345","https://openalex.org/W2094187331","https://openalex.org/W2100717205","https://openalex.org/W2126105956","https://openalex.org/W2142978972","https://openalex.org/W2144531113","https://openalex.org/W2149454052","https://openalex.org/W2252863398","https://openalex.org/W2404885194","https://openalex.org/W2493109494","https://openalex.org/W2531315337","https://openalex.org/W2560729906","https://openalex.org/W2561080469","https://openalex.org/W2564125978","https://openalex.org/W2567640925","https://openalex.org/W2621394166","https://openalex.org/W2766881423","https://openalex.org/W2772079570","https://openalex.org/W2773676050","https://openalex.org/W2803389929","https://openalex.org/W2803933598","https://openalex.org/W2893010165","https://openalex.org/W2914106598","https://openalex.org/W2947336499","https://openalex.org/W2963956318","https://openalex.org/W3020552739","https://openalex.org/W3023935351","https://openalex.org/W3093154753","https://openalex.org/W3102438468","https://openalex.org/W3105444733","https://openalex.org/W3114546550","https://openalex.org/W3133807036","https://openalex.org/W3141233211","https://openalex.org/W3176320637","https://openalex.org/W3198332808","https://openalex.org/W3208749876","https://openalex.org/W4231758816","https://openalex.org/W4323349933","https://openalex.org/W4386011797","https://openalex.org/W4400689395","https://openalex.org/W4403870258","https://openalex.org/W4404868452"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"article,":[2],"we":[3,50,73],"build":[4],"on":[5],"previous":[6],"work":[7],"to":[8,53,81],"present":[9],"an":[10],"optimization":[11,17,67],"algorithm":[12,20],"for":[13],"non-linearly":[14],"constrained":[15],"multi-objective":[16,100],"problems.":[18],"The":[19],"combines":[21],"a":[22,77,82,96],"surrogate-assisted":[23],"derivative-free":[24],"trust-region":[25],"approach":[26],"with":[27,55],"the":[28,37,56,60,91,99],"filter":[29],"method":[30],"known":[31],"from":[32,65],"single-objective":[33,66],"optimization.":[34],"Instead":[35],"of":[36,76,79,98],"true":[38],"objective":[39],"and":[40,49],"constraint":[41,87],"functions,":[42],"so-called":[43],"fully":[44],"linear":[45],"models":[46],"are":[47],"employed,":[48],"show":[51],"how":[52],"deal":[54],"gradient":[57],"inexactness":[58],"in":[59],"composite":[61],"step":[62],"setting,":[63],"adapted":[64],"as":[68],"well.":[69],"Under":[70],"standard":[71],"assumptions,":[72],"prove":[74],"convergence":[75],"subset":[78],"iterates":[80],"quasi-stationary":[83],"point":[84,93],"and,":[85],"if":[86],"qualifications":[88],"hold,":[89],"then":[90],"limit":[92],"is":[94],"also":[95],"KKT-point":[97],"problem.":[101]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2025-12-08T00:00:00"}