{"id":"https://openalex.org/W4386011797","doi":"https://doi.org/10.1007/s10589-023-00510-2","title":"A trust-region approach for computing Pareto fronts in multiobjective optimization","display_name":"A trust-region approach for computing Pareto fronts in multiobjective optimization","publication_year":2023,"publication_date":"2023-08-20","ids":{"openalex":"https://openalex.org/W4386011797","doi":"https://doi.org/10.1007/s10589-023-00510-2"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-023-00510-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-023-00510-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-023-00510-2.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10589-023-00510-2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103220390","display_name":"Azadeh Mohammadi","orcid":"https://orcid.org/0000-0003-3411-9424"},"institutions":[{"id":"https://openalex.org/I83558840","display_name":"Universidade Nova de Lisboa","ror":"https://ror.org/02xankh89","country_code":"PT","type":"education","lineage":["https://openalex.org/I83558840"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"A. Mohammadi","raw_affiliation_strings":["Center for Mathematics and Applications (NOVA MATH), NOVA School of Science and Technology, Campus de Caparica, 2829-516, Caparica, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Mathematics and Applications (NOVA MATH), NOVA School of Science and Technology, Campus de Caparica, 2829-516, Caparica, Portugal","institution_ids":["https://openalex.org/I83558840"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018058104","display_name":"A. L. Cust\u00f3dio","orcid":"https://orcid.org/0000-0003-0890-7398"},"institutions":[{"id":"https://openalex.org/I83558840","display_name":"Universidade Nova de Lisboa","ror":"https://ror.org/02xankh89","country_code":"PT","type":"education","lineage":["https://openalex.org/I83558840"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"A. L. Cust\u00f3dio","raw_affiliation_strings":["Department of Mathematics, Center for Mathematics and Applications (NOVA MATH), NOVA School of Science and Technology, Campus de Caparica, 2829-516, Caparica, Portugal"],"raw_orcid":"https://orcid.org/0000-0003-0890-7398","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Center for Mathematics and Applications (NOVA MATH), NOVA School of Science and Technology, Campus de Caparica, 2829-516, Caparica, Portugal","institution_ids":["https://openalex.org/I83558840"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018058104"],"corresponding_institution_ids":["https://openalex.org/I83558840"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":3.4916,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.93889405,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"87","issue":"1","first_page":"149","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.844805896282196},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7652701139450073},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5857531428337097},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5656678080558777},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5063129663467407},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4703510105609894},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4593968093395233},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.44572392106056213},{"id":"https://openalex.org/keywords/extreme-point","display_name":"Extreme point","score":0.4360009431838989},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4280998706817627},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4224918484687805},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.41188156604766846},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3325392007827759},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19216227531433105}],"concepts":[{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.844805896282196},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7652701139450073},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5857531428337097},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5656678080558777},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5063129663467407},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4703510105609894},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4593968093395233},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.44572392106056213},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.4360009431838989},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4280998706817627},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4224918484687805},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.41188156604766846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3325392007827759},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19216227531433105},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10589-023-00510-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-023-00510-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-023-00510-2.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:coopap:v:87:y:2024:i:1:d:10.1007_s10589-023-00510-2","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10589-023-00510-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:run.unl.pt:10362/171956","is_oa":true,"landing_page_url":"http://hdl.handle.net/10362/171956","pdf_url":null,"source":{"id":"https://openalex.org/S4306400678","display_name":"Universidade Nova de Lisboa's Repository (Universidade Nova de Lisboa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83558840","host_organization_name":"Universidade Nova de Lisboa","host_organization_lineage":["https://openalex.org/I83558840"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"journal article"}],"best_oa_location":{"id":"doi:10.1007/s10589-023-00510-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-023-00510-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-023-00510-2.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.47999998927116394,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G1878529617","display_name":null,"funder_award_id":"UIDB/00297/2020","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G3467324600","display_name":null,"funder_award_id":"UIDP/00297/2020","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G5454278309","display_name":null,"funder_award_id":"/2017","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G5880712023","display_name":null,"funder_award_id":"2020.08249.BD","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G8921366140","display_name":null,"funder_award_id":"PTDC/MAT-APL/28400/2017","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"}],"funders":[{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4386011797.pdf"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W147998453","https://openalex.org/W641771830","https://openalex.org/W1893275031","https://openalex.org/W1964442167","https://openalex.org/W1997275160","https://openalex.org/W1998081129","https://openalex.org/W2004586020","https://openalex.org/W2007294066","https://openalex.org/W2008499862","https://openalex.org/W2024008934","https://openalex.org/W2042517615","https://openalex.org/W2058192020","https://openalex.org/W2098907614","https://openalex.org/W2100717205","https://openalex.org/W2100830227","https://openalex.org/W2101008160","https://openalex.org/W2126105956","https://openalex.org/W2149454052","https://openalex.org/W2225671745","https://openalex.org/W2531315337","https://openalex.org/W2560729906","https://openalex.org/W2561080469","https://openalex.org/W2612468655","https://openalex.org/W2768763952","https://openalex.org/W2803933598","https://openalex.org/W2807637204","https://openalex.org/W2882907813","https://openalex.org/W2963649364","https://openalex.org/W3120891614","https://openalex.org/W4210731468","https://openalex.org/W4229885360","https://openalex.org/W4301014524"],"related_works":["https://openalex.org/W2090178682","https://openalex.org/W4241467429","https://openalex.org/W2001591765","https://openalex.org/W2073147994","https://openalex.org/W2384474142","https://openalex.org/W3083133203","https://openalex.org/W1588199609","https://openalex.org/W2744462909","https://openalex.org/W1971520370","https://openalex.org/W1550055091"],"abstract_inverted_index":{"Abstract":[0],"Multiobjective":[1],"optimization":[2,75,108,227],"is":[3,26,50,59,95,151,200],"a":[4,29,33,42,73,92,106,224],"challenging":[5],"scientific":[6],"area,":[7],"where":[8],"the":[9,13,20,38,47,56,68,79,82,99,117,123,136,141,147,154,157,163,170,184,187,198,208,215],"conflicting":[10],"nature":[11],"of":[12,22,35,72,101,105,119,146,166,173,197,210],"different":[14,83,124],"objectives":[15,54],"to":[16,52,61,67,97,113,152,156,169,182],"be":[17,114,130],"optimized":[18],"changes":[19],"concept":[21],"problem":[23],"solution,":[24],"which":[25,128],"no":[27],"longer":[28],"single":[30],"point":[31,138,149],"but":[32],"set":[34,100],"points,":[36],"namely":[37],"Pareto":[39,70,102,158,188],"front.":[40],"In":[41,85],"posteriori":[43],"preferences":[44],"approach,":[45],"when":[46],"decision":[48],"maker":[49],"unable":[51],"rank":[53],"before":[55],"optimization,":[57],"it":[58],"important":[60],"develop":[62],"algorithms":[63],"that":[64],"generate":[65],"approximations":[66],"complete":[69],"front":[71],"multiobjective":[74,107,226],"problem,":[76],"making":[77],"clear":[78],"trade-offs":[80],"between":[81],"objectives.":[84],"this":[86],"work,":[87],"an":[88],"algorithm":[89],"based":[90],"on":[91,186],"trust-region":[93],"approach":[94],"proposed":[96],"approximate":[98],"critical":[103],"points":[104,165],"problem.":[109],"Derivatives":[110],"are":[111,205],"assumed":[112],"known,":[115],"allowing":[116],"computation":[118],"Taylor":[120],"models":[121],"for":[122],"objective":[125,175],"function":[126,176],"components,":[127],"will":[129],"minimized":[131],"in":[132,214],"two":[133],"main":[134],"steps:":[135],"extreme":[137,148,164],"step":[139,150,180],"and":[140,202,218],"scalarization":[142,179,193],"step.":[143],"The":[144,178,195],"goal":[145],"expand":[153],"approximation":[155],"front,":[159,189],"by":[160,190,221],"moving":[161],"towards":[162],"it,":[167],"corresponding":[168],"individual":[171],"minimization":[172],"each":[174,211],"component.":[177],"attempts":[181],"reduce":[183],"gaps":[185],"solving":[191],"adequate":[192],"problems.":[194],"convergence":[196],"method":[199],"analyzed":[201],"numerical":[203],"experiments":[204],"reported,":[206],"indicating":[207],"relevance":[209],"feature":[212],"included":[213],"algorithmic":[216],"structure":[217],"its":[219],"competitiveness,":[220],"comparison":[222],"against":[223],"state-of-art":[225],"algorithm.":[228]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":6}],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2025-10-10T00:00:00"}