{"id":"https://openalex.org/W3035016937","doi":"https://doi.org/10.1145/3357713.3384338","title":"Positive semidefinite programming: mixed, parallel, and width-independent","display_name":"Positive semidefinite programming: mixed, parallel, and width-independent","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3035016937","doi":"https://doi.org/10.1145/3357713.3384338","mag":"3035016937"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384338","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384338","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-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/A5050732684","display_name":"Arun Jambulapati","orcid":"https://orcid.org/0009-0007-9964-893X"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arun Jambulapati","raw_affiliation_strings":["Stanford University, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024980585","display_name":"Yin Tat Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yin Tat Lee","raw_affiliation_strings":["University of Washington, USA / Microsoft Research, USA"],"affiliations":[{"raw_affiliation_string":"University of Washington, USA / Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006277823","display_name":"Jerry Li","orcid":"https://orcid.org/0000-0002-5631-4127"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jerry Li","raw_affiliation_strings":["Microsoft Research, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042979350","display_name":"Swati Padmanabhan","orcid":"https://orcid.org/0000-0002-4834-2136"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Swati Padmanabhan","raw_affiliation_strings":["University of Washington, USA"],"affiliations":[{"raw_affiliation_string":"University of Washington, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101553600","display_name":"Kevin Tian","orcid":"https://orcid.org/0000-0003-0109-9201"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin Tian","raw_affiliation_strings":["Stanford University, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5050732684"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":3.5341,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.93061516,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"789","last_page":"802"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.8574255704879761},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.6117170453071594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5450177788734436},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35243117809295654},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3361571729183197},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3306915760040283},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.32771873474121094},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.09691718220710754}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8574255704879761},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.6117170453071594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5450177788734436},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35243117809295654},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3361571729183197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3306915760040283},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.32771873474121094},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.09691718220710754}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357713.3384338","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384338","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W796181159","https://openalex.org/W1484132899","https://openalex.org/W1836227897","https://openalex.org/W1885293871","https://openalex.org/W1916091028","https://openalex.org/W1968135284","https://openalex.org/W1985123706","https://openalex.org/W1985852691","https://openalex.org/W1995547833","https://openalex.org/W2001266526","https://openalex.org/W2005059149","https://openalex.org/W2014029180","https://openalex.org/W2023349184","https://openalex.org/W2040466831","https://openalex.org/W2053924317","https://openalex.org/W2063241141","https://openalex.org/W2064769982","https://openalex.org/W2069816168","https://openalex.org/W2071461214","https://openalex.org/W2073378277","https://openalex.org/W2073637342","https://openalex.org/W2078289947","https://openalex.org/W2088844265","https://openalex.org/W2089559088","https://openalex.org/W2089703809","https://openalex.org/W2094178408","https://openalex.org/W2134422938","https://openalex.org/W2150865801","https://openalex.org/W2152666411","https://openalex.org/W2157604254","https://openalex.org/W2163656645","https://openalex.org/W2164818780","https://openalex.org/W2169401877","https://openalex.org/W2279748049","https://openalex.org/W2295995314","https://openalex.org/W2475014229","https://openalex.org/W2543273498","https://openalex.org/W2560674852","https://openalex.org/W2594480752","https://openalex.org/W2627073818","https://openalex.org/W2795336731","https://openalex.org/W2895053471","https://openalex.org/W2905277283","https://openalex.org/W2912522929","https://openalex.org/W2952399199","https://openalex.org/W2962718424","https://openalex.org/W2962877742","https://openalex.org/W2998535217","https://openalex.org/W4239400817","https://openalex.org/W4243547443","https://openalex.org/W4247950230","https://openalex.org/W6639299341","https://openalex.org/W6760275668","https://openalex.org/W6764720292"],"related_works":["https://openalex.org/W2348903644","https://openalex.org/W2975050997","https://openalex.org/W2737505353","https://openalex.org/W2912522929","https://openalex.org/W1653317167","https://openalex.org/W1989828432","https://openalex.org/W2364528045","https://openalex.org/W2352839224","https://openalex.org/W2385886188","https://openalex.org/W4240313861"],"abstract_inverted_index":{"We":[0,239],"give":[1,168],"the":[2,85,95,105,133,155,230,247],"first":[3],"approximation":[4],"algorithm":[5,74,159,243],"for":[6,43,205,252],"mixed":[7,206],"packing":[8,20,51,116],"and":[9,21,36,53,88,108,130,145,190,219,244,256],"covering":[10,22,217],"semidefinite":[11,45,109,254],"programs":[12],"(SDPs)":[13],"with":[14,29,225],"polylogarithmic":[15],"dependence":[16],"on":[17,228],"width.":[18],"Mixed":[19],"SDPs":[23],"constitute":[24],"a":[25,60,67,91,127,200,220,236],"fundamental":[26],"algorithmic":[27],"primitive":[28],"applications":[30],"in":[31,104,161,185,235],"combinatorial":[32],"optimization,":[33],"robust":[34],"learning,":[35],"quantum":[37],"complexity.":[38],"The":[39],"current":[40],"approximate":[41],"solvers":[42,251],"positive":[44,64,106,207,253],"programming":[46,110,255],"can":[47],"handle":[48],"only":[49],"pure":[50,115],"instances,":[52,154],"technical":[54],"hurdles":[55],"prevent":[56],"their":[57],"generalization":[58],"to":[59,114,136,172,180,196,249],"wider":[61],"class":[62],"of":[63,71,94,132,157,202,222,233],"instances.":[65],"For":[66,150],"given":[68],"multiplicative":[69],"accuracy":[70],"\u0454,":[72],"our":[73,118,158,197,242],"takes":[75],"O(log3(nd\u03c1)":[76],"\u00b7":[77,125],"\u0454\u22123)":[78],"parallelizable":[79],"iterations,":[80],"where":[81],"n,":[82],"d":[83],"are":[84,199],"problem":[86],"dimensions":[87],"\u03c1":[89],"is":[90,122],"width":[92],"parameter":[93],"instance,":[96],"generalizing":[97],"or":[98],"improving":[99],"all":[100],"previous":[101],"parallel":[102],"algorithms":[103,204],"linear":[107,208],"literature.":[111],"When":[112],"specialized":[113],"SDPs,":[117],"algorithm\u2019s":[119],"iteration":[120],"complexity":[121],"O(log2":[123],"(nd)":[124],"\u0454\u22122),":[126],"slight":[128],"improvement":[129],"derandomization":[131],"state-of-the-art":[134],"due":[135],"Allen-Zhu":[137],"et.":[138,142,147,187,192],"al.":[139,143,148,188,193],"\u201916,":[140,144],"Peng":[141,186],"Wang":[146],"\u201915.":[149],"several":[151],"common":[152],"structured":[153],"iterations":[156],"run":[160],"nearly-linear":[162],"time.":[163],"In":[164],"doing":[165],"so,":[166],"we":[167],"matrix":[169,223],"analytic":[170],"techniques":[171,245],"overcome":[173],"obstacles":[174],"that":[175,241],"have":[176],"stymied":[177],"prior":[178],"approaches":[179],"this":[181],"problem,":[182],"as":[183],"stated":[184],"\u201916":[189],"Mahoney":[191],"\u201916.":[194],"Crucial":[195],"analysis":[198],"simplification":[201],"existing":[203],"programs,":[209],"achieved":[210],"by":[211],"removing":[212],"an":[213],"asymmetry":[214],"from":[215],"modifying":[216],"constraints,":[218],"suite":[221],"inequalities":[224],"proofs":[226],"based":[227],"analyzing":[229],"Schur":[231],"complements":[232],"matrices":[234],"higher":[237],"dimension.":[238],"hope":[240],"open":[246],"door":[248],"improved":[250],"its":[257],"applications.":[258]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}