{"id":"https://openalex.org/W2892075628","doi":"https://doi.org/10.1137/17m1143484","title":"Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs","display_name":"Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2892075628","doi":"https://doi.org/10.1137/17m1143484","mag":"2892075628"},"language":"en","primary_location":{"id":"doi:10.1137/17m1143484","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1143484","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/A5024668916","display_name":"Th\u00e1i Do\u00e3n Ch\u01b0\u01a1ng","orcid":"https://orcid.org/0000-0003-0893-5604"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Thai Doan Chuong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024668916"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.422,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.89682276,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"28","issue":"3","first_page":"2466","last_page":"2488"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"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"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9950000047683716,"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/mathematics","display_name":"Mathematics","score":0.8728439807891846},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7265705466270447},{"id":"https://openalex.org/keywords/explained-sum-of-squares","display_name":"Explained sum of squares","score":0.5610938668251038},{"id":"https://openalex.org/keywords/linear-matrix-inequality","display_name":"Linear matrix inequality","score":0.5601744055747986},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.53862464427948},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5316532254219055},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.526648998260498},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.46478271484375},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.4545021951198578},{"id":"https://openalex.org/keywords/strong-duality","display_name":"Strong duality","score":0.4312573969364166},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4175889790058136},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41602396965026855},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3242930769920349},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3242757320404053},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.2617858946323395},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26116621494293213}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8728439807891846},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7265705466270447},{"id":"https://openalex.org/C49847556","wikidata":"https://www.wikidata.org/wiki/Q3964631","display_name":"Explained sum of squares","level":2,"score":0.5610938668251038},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.5601744055747986},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.53862464427948},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5316532254219055},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.526648998260498},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.46478271484375},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.4545021951198578},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.4312573969364166},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4175889790058136},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41602396965026855},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3242930769920349},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3242757320404053},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.2617858946323395},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26116621494293213},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/17m1143484","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1143484","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6024945067","display_name":"T\u1ed1i \u01b0u \u0111a tr\u1ecb v\u1edbi ti\u00eau chu\u1ea9n v\u00e9c t\u01a1 v\u00e0 ti\u00eau chu\u1ea9n t\u1eadp v\u00e0 c\u00e1c v\u1ea5n \u0111\u1ec1 li\u00ean quan","funder_award_id":"101.01-2017.08","funder_id":"https://openalex.org/F4320309617","funder_display_name":"National Foundation for Science and Technology Development"}],"funders":[{"id":"https://openalex.org/F4320309617","display_name":"National Foundation for Science and Technology Development","ror":"https://ror.org/04rw64z44"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W650424426","https://openalex.org/W1969962394","https://openalex.org/W1973533265","https://openalex.org/W1974962384","https://openalex.org/W1985077192","https://openalex.org/W1993400404","https://openalex.org/W2000285254","https://openalex.org/W2029010593","https://openalex.org/W2040587566","https://openalex.org/W2044298677","https://openalex.org/W2065706751","https://openalex.org/W2088140565","https://openalex.org/W2107543637","https://openalex.org/W2111921207","https://openalex.org/W2131116400","https://openalex.org/W2132579825","https://openalex.org/W2149726897","https://openalex.org/W2152533835","https://openalex.org/W2195191279","https://openalex.org/W2255400221","https://openalex.org/W2256115709","https://openalex.org/W2560530591","https://openalex.org/W2754441833","https://openalex.org/W2755386969","https://openalex.org/W3103158853"],"related_works":["https://openalex.org/W2124038748","https://openalex.org/W2493494838","https://openalex.org/W2189286193","https://openalex.org/W2941716933","https://openalex.org/W4381623700","https://openalex.org/W4225397084","https://openalex.org/W4390640000","https://openalex.org/W2963700124","https://openalex.org/W4301659259","https://openalex.org/W2771160919"],"abstract_inverted_index":{"This":[0],"paper":[1],"is":[2],"concerned":[3],"with":[4],"an":[5],"uncertain":[6],"multiobjective":[7,46,82,95],"optimization":[8,29,47,98],"problem,":[9],"where":[10],"the":[11,21,43,70,73,93,128],"objective":[12],"and":[13,20,35,59,88,100,104],"constraint":[14],"functions":[15],"are":[16,24,52],"sums-of-squares--convex":[17],"(SOS-convex)":[18],"polynomials,":[19],"uncertainty":[22],"sets":[23],"spectrahedra.":[25],"Using":[26],"a":[27,65,80,114],"robust":[28,45,94],"approach,":[30],"we":[31,112],"first":[32],"establish":[33],"necessary":[34],"sufficient":[36],"optimality":[37,50,75],"conditions":[38,58],"for":[39,122],"weakly":[40],"efficiencies":[41],"of":[42,56,69,72,86,127],"corresponding":[44],"problem.":[48,130],"These":[49],"criteria":[51],"expressed":[53],"in":[54],"terms":[55],"sums-of-squares":[57,87],"linear":[60,89,116],"matrix":[61,90],"inequalities,":[62],"which":[63],"provide":[64],"numerically":[66],"checkable":[67],"certificate":[68],"solvability":[71],"given":[74],"conditions.":[76],"We":[77],"then":[78],"propose":[79],"dual":[81],"problem":[83,99,121],"by":[84],"means":[85],"inequalities":[91],"to":[92],"SOS-convex":[96],"polynomial":[97],"examine":[101],"weak,":[102],"strong,":[103],"converse":[105],"duality":[106],"relations":[107],"between":[108],"them.":[109],"In":[110],"addition,":[111],"consider":[113],"semidefinite":[115],"programming":[117],"(SDP)":[118],"weighted-sum":[119,124],"relaxation":[120],"verifying":[123],"efficient":[125],"values":[126],"primal":[129]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4}],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2025-10-10T00:00:00"}