{"id":"https://openalex.org/W7214657180","doi":"https://doi.org/10.48550/arxiv.2609.30853","title":"Faster Linear Programming with $\\sqrt{\\mathrm{rank}}$ Linear System Solves","display_name":"Faster Linear Programming with $\\sqrt{\\mathrm{rank}}$ Linear System Solves","publication_year":2026,"publication_date":"2026-09-25","ids":{"openalex":"https://openalex.org/W7214657180","doi":"https://doi.org/10.48550/arxiv.2609.30853"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.30853","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.30853","pdf_url":"https://arxiv.org/pdf/2609.30853","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.30853","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5153321996","display_name":"Zhao Song","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Song, Zhao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5153321996"],"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.7196999788284302,"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.7196999788284302,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.2506999969482422,"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.016200000420212746,"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/linear-programming","display_name":"linear programming","score":0.9480000138282776},{"id":"https://openalex.org/keywords/interior-point-methods","display_name":"interior point methods","score":0.8410000205039978},{"id":"https://openalex.org/keywords/complexity-bounds","display_name":"complexity bounds","score":0.4909999966621399}],"concepts":[{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.7031999826431274},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6876000165939331},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6229000091552734},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5745999813079834},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.4645000100135803},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.4489000141620636},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4343999922275543},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.43299999833106995},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39149999618530273},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3822999894618988},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.3677999973297119},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3555999994277954},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.3402999937534332},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.29670000076293945},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2946000099182129},{"id":"https://openalex.org/C163175372","wikidata":"https://www.wikidata.org/wiki/Q3339222","display_name":"Linear model","level":2,"score":0.2854999899864197},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2782999873161316},{"id":"https://openalex.org/C114275822","wikidata":"https://www.wikidata.org/wiki/Q621512","display_name":"Linear dynamical system","level":3,"score":0.2711000144481659},{"id":"https://openalex.org/C3017564526","wikidata":"https://www.wikidata.org/wiki/Q15854269","display_name":"Linear growth","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C49766605","wikidata":"https://www.wikidata.org/wiki/Q207643","display_name":"Linear map","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.25220000743865967},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.30853","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.30853","pdf_url":"https://arxiv.org/pdf/2609.30853","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.30853","doi":"https://doi.org/10.48550/arxiv.2609.30853","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.30853","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.30853","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.30853","pdf_url":"https://arxiv.org/pdf/2609.30853","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214657180.pdf","grobid_xml":"https://content.openalex.org/works/W7214657180.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W2980475696","https://openalex.org/W7203702364"],"related_works":["https://openalex.org/W7206174734","https://openalex.org/W7207632731","https://openalex.org/W1940743563","https://openalex.org/W7099759775","https://openalex.org/W1557485143","https://openalex.org/W2980475696","https://openalex.org/W3187058210","https://openalex.org/W2044019891","https://openalex.org/W2982118377","https://openalex.org/W2073801003"],"abstract_inverted_index":{"Lee":[0],"and":[1,52,91],"Sidford":[2],"[LS19]":[3],"showed":[4],"that":[5,77,102,122],"the":[6,47,50,54,59,69,79,112],"linear":[7,33,109],"program":[8],"$\\min\\{c^\\top":[9],"x\\":[10],":\\":[11],"A^\\top":[12],"x=b,\\":[13],"l\\leq":[14],"x\\leq":[15],"u\\}$":[16],"over":[17],"$x\\in\\mathbb{R}^m$,":[18],"where":[19,44],"$A\\in\\mathbb{R}^{m\\times":[20],"n}$,":[21],"can":[22],"be":[23],"solved":[24],"to":[25],"accuracy":[26],"$\u03b5$":[27],"using":[28],"$O(\\sqrt":[29,104,123],"n\\log^{13}m\\cdot\\log(mU/\u03b5))$":[30],"solves":[31,106,127],"of":[32,49,53,71,107,118],"systems":[34],"in":[35],"$A^\\top\\mathbf":[36],"DA$":[37],"for":[38],"positive":[39],"diagonal":[40],"matrices":[41],"$\\mathbf":[42],"D$,":[43],"$U$":[45],"bounds":[46],"magnitudes":[48],"input":[51],"initial":[55],"point.":[56],"Theirs":[57],"is":[58,82],"first":[60],"such":[61,108,125],"bound":[62,96,114],"governed":[63],"by":[64,68,115],"$\\mathrm{rank}(A)=n$":[65],"rather":[66],"than":[67],"number":[70],"constraints":[72],"$m$.":[73],"Song":[74],"[Son19]":[75],"mentioned":[76],"reducing":[78],"$\\log^{13}m$":[80],"factor":[81,117],"an":[83,88,100],"interesting":[84],"future":[85],"direction.":[86],"Given":[87],"interior":[89],"point":[90],"a":[92,116],"finite":[93],"certified":[94],"magnitude":[95],"$U$,":[97],"we":[98],"give":[99],"algorithm":[101],"uses":[103],"n\\log^{4}m\\cdot\\log(mU/\u03b5))$":[105],"systems,":[110],"improving":[111],"Lee--Sidford":[113],"$\\log^{9}m$.":[119],"We":[120],"conjecture":[121],"n\\log(mU/\u03b5))$":[124],"linear-system":[126],"suffice.":[128]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-29T00:00:00"}