{"id":"https://openalex.org/W7127640024","doi":"https://doi.org/10.1137/24m1694112","title":"Exploring Chordal Sparsity in Semidefinite Programming with Sparse plus Low-Rank Data Matrices","display_name":"Exploring Chordal Sparsity in Semidefinite Programming with Sparse plus Low-Rank Data Matrices","publication_year":2026,"publication_date":"2026-02-04","ids":{"openalex":"https://openalex.org/W7127640024","doi":"https://doi.org/10.1137/24m1694112"},"language":"en","primary_location":{"id":"doi:10.1137/24m1694112","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1694112","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/A5125058636","display_name":"Tianyun Tang","orcid":null},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Tianyun Tang","raw_affiliation_strings":["Department of Mathematics, National University of Singapore, Singapore 119076"],"raw_orcid":"https://orcid.org/0000-0001-6619-0474","affiliations":[{"raw_affiliation_string":"Department of Mathematics, National University of Singapore, Singapore 119076","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5124989836","display_name":"Kim-Chuan Toh","orcid":null},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Kim-Chuan Toh","raw_affiliation_strings":["Department of Mathematics and Institute of Operations Research and Analytics, National University of Singapore, Singapore 119076"],"raw_orcid":"https://orcid.org/0000-0001-7204-8933","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Institute of Operations Research and Analytics, National University of Singapore, Singapore 119076","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10883058,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":"1","first_page":"90","last_page":"119"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.4932999908924103,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.4932999908924103,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.14710000157356262,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.10300000011920929,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.7926999926567078},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.4059000015258789},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4034999907016754},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.3840000033378601},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3440000116825104},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.32429999113082886}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7926999926567078},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6988999843597412},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40619999170303345},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.4059000015258789},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4034999907016754},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.3840000033378601},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37630000710487366},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.349700003862381},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3440000116825104},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.32429999113082886},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3066999912261963},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.2976999878883362},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2924000024795532},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28529998660087585},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27219998836517334}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/24m1694112","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1694112","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/G2456287193","display_name":null,"funder_award_id":"MOE\u20132019\u2013T3\u20131\u2013010","funder_id":"https://openalex.org/F4320320751","funder_display_name":"Ministry of Education - Singapore"}],"funders":[{"id":"https://openalex.org/F4320320751","display_name":"Ministry of Education - Singapore","ror":"https://ror.org/01kcva023"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1861508522","https://openalex.org/W1967073510","https://openalex.org/W1999913571","https://openalex.org/W2005102197","https://openalex.org/W2006704773","https://openalex.org/W2021640942","https://openalex.org/W2033405938","https://openalex.org/W2034769312","https://openalex.org/W2049371785","https://openalex.org/W2071143636","https://openalex.org/W2071916795","https://openalex.org/W2076199517","https://openalex.org/W2078289947","https://openalex.org/W2078600458","https://openalex.org/W2082156532","https://openalex.org/W2087999447","https://openalex.org/W2113280143","https://openalex.org/W2143075842","https://openalex.org/W2146826069","https://openalex.org/W2170975529","https://openalex.org/W2738121580","https://openalex.org/W2885880010","https://openalex.org/W3013880646","https://openalex.org/W3127944417","https://openalex.org/W4200490012","https://openalex.org/W4213232386","https://openalex.org/W4292070118","https://openalex.org/W4313590496","https://openalex.org/W4362585750","https://openalex.org/W4391655859","https://openalex.org/W4400244112"],"related_works":[],"abstract_inverted_index":{"Abstract.":[0],"Semidefinite":[1],"programming":[2],"(SDP)":[3],"problems":[4,18,39,58,76,80,94],"are":[5,99],"challenging":[6],"to":[7,25,73],"solve":[8],"because":[9,29],"of":[10],"their":[11],"high":[12],"dimensionality.":[13],"However,":[14],"solving":[15],"sparse":[16,63,78],"SDP":[17,38,57,79,93],"with":[19,81,95],"small":[20],"tree":[21,83],"width":[22],"is":[23],"known":[24],"be":[26,33],"relatively":[27],"easier":[28],"(1)":[30],"they":[31,45],"can":[32],"decomposed":[34],"into":[35,77],"smaller":[36],"multiblock":[37],"through":[40],"chordal":[41],"conversion":[42],"and":[43],"(2)":[44],"have":[46,62],"low-rank":[47,65],"optimal":[48],"solutions.":[49],"In":[50],"this":[51],"paper,":[52],"we":[53,88],"study":[54],"more":[55],"general":[56],"whose":[59],"coefficient":[60],"matrices":[61],"plus":[64],"(SPLR)":[66],"structure.":[67],"We":[68],"develop":[69],"a":[70],"unified":[71],"framework":[72],"convert":[74],"such":[75],"bounded":[82],"width.":[84],"Based":[85],"on":[86],"this,":[87],"derive":[89],"rank":[90],"bounds":[91],"for":[92],"SPLR":[96],"structure,":[97],"which":[98],"tight":[100],"in":[101],"the":[102],"worst":[103],"case.":[104]},"counts_by_year":[],"updated_date":"2026-08-22T07:34:49.880490","created_date":"2026-02-06T00:00:00"}