{"id":"https://openalex.org/W4387963802","doi":"https://doi.org/10.48550/arxiv.2310.16351","title":"Fast Algorithms for Separable Linear Programs","display_name":"Fast Algorithms for Separable Linear Programs","publication_year":2023,"publication_date":"2023-10-25","ids":{"openalex":"https://openalex.org/W4387963802","doi":"https://doi.org/10.48550/arxiv.2310.16351"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2310.16351","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2310.16351","pdf_url":"https://arxiv.org/pdf/2310.16351","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2310.16351","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017229799","display_name":"Sally Dong","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dong, Sally","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078315645","display_name":"Gramoz Goranci","orcid":"https://orcid.org/0000-0002-9603-2255"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Goranci, Gramoz","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061257483","display_name":"Lawrence Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Lawrence","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067464936","display_name":"Sushant Sachdeva","orcid":"https://orcid.org/0000-0002-5393-9324"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sachdeva, Sushant","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051309071","display_name":"Guanghao Ye","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ye, Guanghao","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5017229799"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9758999943733215,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9758999943733215,"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/T12288","display_name":"Optimization and Search Problems","score":0.9682000279426575,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.920199990272522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.7562447190284729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6123603582382202},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5966895222663879},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5149789452552795},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4800482988357544},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4611949920654297},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.43923497200012207},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42680519819259644},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4263041019439697},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.42241039872169495},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3760870397090912},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.219570130109787},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.124325692653656},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11465251445770264}],"concepts":[{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.7562447190284729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6123603582382202},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5966895222663879},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5149789452552795},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4800482988357544},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4611949920654297},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.43923497200012207},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42680519819259644},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4263041019439697},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.42241039872169495},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3760870397090912},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.219570130109787},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.124325692653656},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11465251445770264},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2310.16351","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2310.16351","pdf_url":"https://arxiv.org/pdf/2310.16351","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2310.16351","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2310.16351","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2310.16351","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2310.16351","pdf_url":"https://arxiv.org/pdf/2310.16351","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4387963802.pdf","grobid_xml":"https://content.openalex.org/works/W4387963802.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2965106131","https://openalex.org/W2094757704","https://openalex.org/W2114808974","https://openalex.org/W25030584","https://openalex.org/W29231041","https://openalex.org/W2610104823","https://openalex.org/W2746454974","https://openalex.org/W2074889170","https://openalex.org/W2092044038","https://openalex.org/W2144582354"],"abstract_inverted_index":{"In":[0],"numerical":[1],"linear":[2,14,50,62,81],"algebra,":[3],"considerable":[4],"effort":[5],"has":[6,144],"been":[7],"devoted":[8],"to":[9],"obtaining":[10],"faster":[11,61,77],"algorithms":[12],"for":[13,33,79,129,148],"systems":[15],"whose":[16,207],"underlying":[17,59],"matrices":[18,117],"exhibit":[19],"structural":[20],"properties.":[21],"A":[22],"prominent":[23],"success":[24],"story":[25],"is":[26,105,134,176,188,210,217],"the":[27,37,40,46,57,67,71,88,94,98,135,139,149,166,172,196,218,224,231],"method":[28],"of":[29,42,48,70,87,97,138,174,199,226,233],"generalized":[30],"nested":[31,205],"dissection~[Lipton-Rose-Tarjan'79]":[32],"separable":[34,68,80],"matrices.":[35],"On":[36],"other":[38],"hand,":[39],"majority":[41],"recent":[43],"developments":[44],"in":[45,161,165,184,223],"design":[47],"efficient":[49],"program":[51],"(LP)":[52],"solves":[53],"do":[54],"not":[55],"leverage":[56],"ideas":[58],"these":[60,130],"system":[63],"solvers":[64],"nor":[65],"consider":[66,85],"structure":[69,241],"constraint":[72,99],"matrix.":[73],"We":[74,120],"give":[75],"a":[76],"algorithm":[78,128,159,182],"programs.":[82],"Specifically,":[83],"we":[84,156,229],"LPs":[86],"form":[89],"$\\min_{\\mathbf{A}\\mathbf{x}=\\mathbf{b},":[90],"\\mathbf{l}\\leq\\mathbf{x}\\leq\\mathbf{u}}":[91],"\\mathbf{c}^\\top\\mathbf{x}$,":[92],"where":[93,132,215],"graphical":[95],"support":[96,173],"matrix":[100,219],"$\\mathbf{A}":[101],"\\in":[102],"\\mathbb{R}^{n\\times":[103],"m}$":[104],"$O(n^\u03b1)$-separable.":[106],"These":[107],"include":[108],"flow":[109,151],"problems":[110],"on":[111,153],"planar":[112,154],"graphs":[113],"and":[114,170,204,235],"low":[115],"treewidth":[116],"among":[118],"others.":[119],"present":[121],"an":[122,158],"$\\tilde{O}((m+m^{1/2":[123],"+":[124],"2\u03b1})":[125],"\\log(1/\u03b5))$":[126],"time":[127,164,208],"LPs,":[131,228],"$\u03b5$":[133],"relative":[136],"accuracy":[137,168],"solution.":[140],"Our":[141],"new":[142],"solver":[143],"two":[145],"important":[146],"implications:":[147],"$k$-multicommodity":[150],"problem":[152],"graphs,":[155],"obtain":[157],"running":[160],"$\\tilde{O}(k^{5/2}":[162],"m^{3/2})$":[163],"high":[167],"regime;":[169],"when":[171],"$\\mathbf{A}$":[175],"$O(n^\u03b1)$-separable":[177],"with":[178,237],"$\u03b1\\leq":[179],"1/4$,":[180],"our":[181],"runs":[183],"$\\tilde{O}(m)$":[185],"time,":[186],"which":[187],"nearly":[189],"optimal.":[190],"The":[191],"latter":[192],"significantly":[193,238],"improves":[194],"upon":[195],"natural":[197],"approach":[198],"combining":[200],"interior":[201],"point":[202],"methods":[203],"dissection,":[206],"complexity":[209],"lower":[211],"bounded":[212],"by":[213],"$\u03a9(\\sqrt{m}(m+m^{\u03b1\u03c9}))=\u03a9(m^{3/2})$,":[214],"$\u03c9$":[216],"multiplication":[220],"constant.":[221],"Lastly,":[222],"setting":[225],"low-treewidth":[227],"recover":[230],"results":[232],"[DLY,STOC21]":[234],"[GS,22]":[236],"simpler":[239],"data":[240],"machinery.":[242]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}