{"id":"https://openalex.org/W2531315337","doi":"https://doi.org/10.1137/15m1016424","title":"A Method for Constrained Multiobjective Optimization Based on SQP Techniques","display_name":"A Method for Constrained Multiobjective Optimization Based on SQP Techniques","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2531315337","doi":"https://doi.org/10.1137/15m1016424","mag":"2531315337"},"language":"en","primary_location":{"id":"doi:10.1137/15m1016424","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1016424","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019337941","display_name":"J\u00f6rg Fliege","orcid":"https://orcid.org/0000-0002-4459-5419"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"J\u00f6rg Fliege","raw_affiliation_strings":["School of Mathematics, University of Southampton, Southampton, SO17 1BJ, UK"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Southampton, Southampton, SO17 1BJ, UK","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114374105","display_name":"A. Ismael F. Vaz","orcid":"https://orcid.org/0000-0002-9972-7474"},"institutions":[{"id":"https://openalex.org/I99682543","display_name":"University of Minho","ror":"https://ror.org/037wpkx04","country_code":"PT","type":"education","lineage":["https://openalex.org/I99682543"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"A. Ismael F. Vaz","raw_affiliation_strings":["ALGORITMI Research Center, University of Minho, Campus of Gualtar, 4710-057 Braga, Por-tugal"],"affiliations":[{"raw_affiliation_string":"ALGORITMI Research Center, University of Minho, Campus of Gualtar, 4710-057 Braga, Por-tugal","institution_ids":["https://openalex.org/I99682543"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019337941"],"corresponding_institution_ids":["https://openalex.org/I43439940"],"apc_list":null,"apc_paid":null,"fwci":6.1517,"has_fulltext":false,"cited_by_count":96,"citation_normalized_percentile":{"value":0.96546209,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"26","issue":"4","first_page":"2091","last_page":"2119"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"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":0.9998999834060669,"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.9972000122070312,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7769637107849121},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.7576947212219238},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6658359169960022},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.6385973691940308},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6080525517463684},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5596585869789124},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.47983476519584656},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45479846000671387},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.43918612599372864},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4303460717201233},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.41103309392929077},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26361292600631714},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.2622751295566559}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7769637107849121},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.7576947212219238},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6658359169960022},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.6385973691940308},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6080525517463684},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5596585869789124},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.47983476519584656},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45479846000671387},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.43918612599372864},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4303460717201233},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.41103309392929077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26361292600631714},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.2622751295566559},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/15m1016424","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1016424","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:eprints.soton.ac.uk:395345","is_oa":false,"landing_page_url":"http://doi.org/10.1137/15M1016424>).","pdf_url":null,"source":{"id":"https://openalex.org/S4306401019","display_name":"ePrints Soton (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3630153633","display_name":null,"funder_award_id":"POCI-01-0145-FEDER-007043","funder_id":"https://openalex.org/F4320327374","funder_display_name":"Programa Operacional Tem\u00e1tico Factores de Competitividade"},{"id":"https://openalex.org/G7406260186","display_name":null,"funder_award_id":"UID/CEC/00319/2013","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"}],"funders":[{"id":"https://openalex.org/F4320327374","display_name":"Programa Operacional Tem\u00e1tico Factores de Competitividade","ror":null},{"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":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W79353284","https://openalex.org/W1504943474","https://openalex.org/W1969872429","https://openalex.org/W2004586020","https://openalex.org/W2022451981","https://openalex.org/W2024008934","https://openalex.org/W2057830724","https://openalex.org/W2079963825","https://openalex.org/W2087982523","https://openalex.org/W2123871098","https://openalex.org/W2149454052","https://openalex.org/W2152551290","https://openalex.org/W2166028622","https://openalex.org/W2561080469"],"related_works":["https://openalex.org/W2090178682","https://openalex.org/W4241467429","https://openalex.org/W2001591765","https://openalex.org/W2073147994","https://openalex.org/W1588199609","https://openalex.org/W2384474142","https://openalex.org/W2188784735","https://openalex.org/W2589412911","https://openalex.org/W1550055091","https://openalex.org/W2744462909"],"abstract_inverted_index":{"We":[0,72],"propose":[1],"a":[2,23,77,111,116],"method":[3],"for":[4,32,76],"constrained":[5,43,82],"and":[6,38,81,91,115,129],"unconstrained":[7,80],"nonlinear":[8],"multiobjective":[9,83,113],"optimization":[10,44,84],"problems":[11,48,53,85],"that":[12,28],"is":[13,29],"based":[14,54],"on":[15,55],"an":[16],"SQP-type":[17],"approach.":[18],"The":[19,100],"proposed":[20,108],"algorithm":[21,109],"maintains":[22],"list":[24],"of":[25,79,89,106,124],"nondominated":[26,58],"points":[27],"improved":[30],"both":[31,120],"spread":[33],"along":[34],"the":[35,56,87,104,107,122,125,131,137],"Pareto":[36,70,127],"front":[37,128],"optimality":[39],"by":[40],"solving":[41],"single-objective":[42,47],"problems.":[45],"These":[46],"are":[49,98],"derived":[50],"as":[51],"SQP":[52],"given":[57],"points.":[59,71],"Under":[60],"appropriate":[61],"differentiability":[62],"assumptions":[63],"we":[64],"discuss":[65],"convergence":[66],"to":[67,135],"local":[68],"optimal":[69],"provide":[73],"numerical":[74,101],"results":[75,102],"set":[78],"in":[86,121,130],"form":[88],"performance":[90,96],"data":[92],"profiles,":[93],"where":[94],"several":[95],"metrics":[97],"used.":[99],"confirm":[103],"superiority":[105],"against":[110],"state-of-the-art":[112],"solver":[114],"classical":[117],"scalarization":[118],"approach,":[119],"quality":[123],"approximated":[126],"computational":[132],"effort":[133],"necessary":[134],"compute":[136],"approximation.":[138]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":18},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":9}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}