{"id":"https://openalex.org/W2024340911","doi":"https://doi.org/10.1137/07070526x","title":"Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets","display_name":"Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2024340911","doi":"https://doi.org/10.1137/07070526x","mag":"2024340911"},"language":"en","primary_location":{"id":"doi:10.1137/07070526x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/07070526x","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/A5080005590","display_name":"J. William Helton","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. William Helton","raw_affiliation_strings":["helton@math.ucsd.edu and njw@math.ucsd.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"helton@math.ucsd.edu and njw@math.ucsd.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018024598","display_name":"Jiawang Nie","orcid":"https://orcid.org/0000-0003-2637-8274"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiawang Nie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.2274,"has_fulltext":false,"cited_by_count":106,"citation_normalized_percentile":{"value":0.98835054,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"20","issue":"2","first_page":"759","last_page":"791"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"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.9995999932289124,"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.9487000107765198,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9419000148773193,"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.9077117443084717},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.740697979927063},{"id":"https://openalex.org/keywords/invertible-matrix","display_name":"Invertible matrix","score":0.6244250535964966},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5545472502708435},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.53737473487854},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5014336109161377},{"id":"https://openalex.org/keywords/extreme-point","display_name":"Extreme point","score":0.4933277666568756},{"id":"https://openalex.org/keywords/positive-definite-matrix","display_name":"Positive-definite matrix","score":0.4817073941230774},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.45910337567329407},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4576018154621124},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.44084441661834717},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.3617015779018402},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.262045294046402},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.18934351205825806},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.12770739197731018},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10002186894416809},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07526397705078125}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.9077117443084717},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.740697979927063},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.6244250535964966},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5545472502708435},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.53737473487854},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5014336109161377},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.4933277666568756},{"id":"https://openalex.org/C49712288","wikidata":"https://www.wikidata.org/wiki/Q77601250","display_name":"Positive-definite matrix","level":3,"score":0.4817073941230774},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.45910337567329407},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4576018154621124},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.44084441661834717},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3617015779018402},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.262045294046402},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.18934351205825806},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.12770739197731018},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10002186894416809},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07526397705078125},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/07070526x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/07070526x","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:CiteSeerX.psu:10.1.1.244.7780","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.244.7780","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0709.4017v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.245.1262","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.245.1262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0709.4017v2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.245.878","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.245.878","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0709.4017v3.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.333.3225","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.333.3225","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2007/10/1803.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.718.6285","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.718.6285","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.ucsd.edu/%7Enjw/PUBLICPAPERS/SdpUnion.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1507415131","https://openalex.org/W1518341038","https://openalex.org/W1539838732","https://openalex.org/W1568307856","https://openalex.org/W1587069887","https://openalex.org/W1632601927","https://openalex.org/W1974962384","https://openalex.org/W2025202934","https://openalex.org/W2028777326","https://openalex.org/W2170238999","https://openalex.org/W2296319761","https://openalex.org/W2495457432"],"related_works":["https://openalex.org/W2019069959","https://openalex.org/W2389339893","https://openalex.org/W2374624997","https://openalex.org/W2363904277","https://openalex.org/W868123585","https://openalex.org/W2578380588","https://openalex.org/W142701514","https://openalex.org/W1992352038","https://openalex.org/W2121443275","https://openalex.org/W2793184312"],"abstract_inverted_index":{"A":[0,222],"set":[1,19,131,255],"$S\\subseteq\\mathbb{R}^n$":[2],"is":[3,25,36,47,140,228,263,283,324],"called":[4,239],"semidefinite":[5,10],"programming":[6],"(SDP)":[7],"representable":[8,11,94],"or":[9,56,208,217],"if":[12,34],"S":[13,35,40,234],"equals":[14],"the":[15,118,123,136,179,215,219,226,243,247,260,266],"projection":[16],"of":[17,53,69,86,102,126,159,214,218,233,246,250,269],"a":[18,77,110,127,251],"in":[20,273],"higher":[21],"dimensional":[22],"space":[23],"which":[24,319],"describable":[26,48],"by":[27,49,75],"some":[28,230],"linear":[29],"matrix":[30],"inequality":[31],"(LMI).":[32],"Clearly,":[33],"SDP":[37,67,82,93,104,115,124,244,279],"representable,":[38],"then":[39],"must":[41],"be":[42,183],"convex":[43,70,73,129,248],"and":[44,51,63,72,142,178,285,288,304],"semialgebraic":[45,130,254],"(it":[46],"conjunctions":[50],"disjunctions":[52],"polynomial":[54],"equalities":[55],"inequalities).":[57],"This":[58,108],"paper":[59,88],"proves":[60],"sufficient":[61,223,277,303],"conditions":[62,65,306],"necessary":[64,146,289,305],"for":[66,106,112,162,278],"representability":[68,125,245],"sets":[71,95],"hulls":[74],"proposing":[76],"new":[78],"approach":[79],"to":[80,167,309],"constructing":[81],"representations.":[83],"The":[84,200,299,312],"contributions":[85],"this":[87],"are:":[89],"(i)":[90],"For":[91,122,242],"bounded":[92],"$W_1,\\dots,W_m$,":[96],"we":[97,133,257],"give":[98],"an":[99,103,236],"explicit":[100],"construction":[101],"representation":[105],"$\\mathrm{conv}(\\cup_{k=1}^mW_k)$.":[107],"provides":[109],"technique":[111],"building":[113],"global":[114],"representations":[116],"from":[117],"local":[119],"ones.":[120],"(ii)":[121],"compact":[128,252],"S,":[132,163],"prove":[134,276],"sufficient:":[135],"boundary":[137,165],"$\\partial":[138,148,176,195,205,270],"S$":[139,149,177,196,206],"nonsingular":[141,155,164,284,297],"positively":[143,286],"curved,":[144,287],"while":[145],"is:":[147,290],"has":[150,293],"nonnegative":[151,294],"curvature":[152,180,295],"at":[153,172,191,296],"each":[154,173],"point.":[156],"In":[157],"terms":[158],"defining":[160,231],"polynomials":[161,232],"amounts":[166],"them":[168,203],"having":[169,207,210],"nonvanishing":[170],"gradient":[171,216],"point":[174],"on":[175,194],"condition":[181,224,238],"can":[182],"expressed":[184],"as":[185],"their":[186],"strict":[187],"versus":[188],"nonstrict":[189],"quasi-concavity":[190],"those":[192],"points":[193,212],"where":[197],"they":[198],"vanish.":[199],"gaps":[201,227,300],"between":[202,301],"are":[204,307],"not":[209],"singular":[211],"either":[213],"curvature's":[220],"positivity.":[221],"bypassing":[225],"when":[229],"satisfy":[235],"algebraic":[237],"sos-concavity.":[240],"(iii)":[241],"hull":[249],"nonconvex":[253],"T,":[256],"find":[258],"that":[259],"critical":[261],"object":[262],"$\\partial_c":[264,281,291],"T$,":[265],"maximum":[267],"subset":[268],"T$":[271,282,292],"contained":[272],"$\\partial\\mathrm{conv}(T)$.":[274],"We":[275],"representability:":[280],"points.":[298],"our":[302],"similar":[308],"case":[310],"(ii).":[311],"positive":[313],"definite":[314],"Lagrange":[315],"Hessian":[316],"(PDLH)":[317],"condition,":[318],"meshes":[320],"well":[321],"with":[322],"constructions,":[323],"also":[325],"discussed.":[326]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}