{"id":"https://openalex.org/W2071864516","doi":"https://doi.org/10.1137/080717651","title":"Stateless Distributed Gradient Descent for Positive Linear Programs","display_name":"Stateless Distributed Gradient Descent for Positive Linear Programs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2071864516","doi":"https://doi.org/10.1137/080717651","mag":"2071864516"},"language":"en","primary_location":{"id":"doi:10.1137/080717651","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080717651","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5110260801","display_name":"Baruch Awerbuch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Baruch Awerbuch","raw_affiliation_strings":["baruch@cs.jhu.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"baruch@cs.jhu.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074837451","display_name":"Rohit Khandekar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rohit Khandekar","raw_affiliation_strings":["rohitk@us.ibm.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"rohitk@us.ibm.com#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8097,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.80899731,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"38","issue":"6","first_page":"2468","last_page":"2486"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9965000152587891,"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/combinatorics","display_name":"Combinatorics","score":0.7685469388961792},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6306729316711426},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5969040989875793},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4499902129173279},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.44275933504104614},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.43225085735321045},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.41286370158195496},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34821364283561707},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2662579417228699},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.13306266069412231}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7685469388961792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6306729316711426},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5969040989875793},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4499902129173279},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.44275933504104614},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.43225085735321045},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.41286370158195496},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34821364283561707},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2662579417228699},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.13306266069412231},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/080717651","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080717651","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.130.7394","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.7394","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.iitd.ernet.in/~rohitk/research/statelessLP-STOC08.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":7,"referenced_works":["https://openalex.org/W1993161326","https://openalex.org/W2017345786","https://openalex.org/W2054910423","https://openalex.org/W2111132249","https://openalex.org/W2117595194","https://openalex.org/W2122205547","https://openalex.org/W2134422938"],"related_works":["https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2567825307","https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2371352078","https://openalex.org/W2362975861","https://openalex.org/W2054458431","https://openalex.org/W2804963084","https://openalex.org/W2898827770"],"abstract_inverted_index":{"We":[0],"develop":[1],"a":[2,24,32,61,102,136,144,340,372],"framework":[3],"of":[4,50,81,157,161,170,176,251,257,288,294,305,311,333,349],"distributed":[5,66,336],"and":[6,11,38,74,87,110,142,153,159,163,179,232,247,263,300,324,355],"stateless":[7,323],"solutions":[8],"for":[9,64,106,201],"packing":[10,92],"covering":[12,203],"linear":[13,223],"programs":[14],"(LPs),":[15],"which":[16,54,320],"are":[17,84,155],"solved":[18],"by":[19,185,371],"multiple":[20],"agents":[21],"operating":[22],"in":[23,53,147,220],"cooperative":[25],"but":[26],"uncoordinated":[27],"manner.":[28],"Our":[29,132,328,344],"model":[30,63],"has":[31,56,325],"separate":[33],"\u201cagent\u201d":[34],"controlling":[35],"each":[36,107,111],"variable,":[37],"an":[39],"agent":[40,112],"is":[41,60,123,173,316,321,362],"allowed":[42],"to":[43,130],"read":[44],"off":[45],"the":[46,91,99,168,171,174,177,180,186,190,195,202,252,289,306,317,359,367],"current":[47,360],"values":[48,183],"only":[49],"those":[51,348],"constraints":[52],"it":[55],"nonzero":[57,182],"coefficients.":[58],"This":[59],"natural":[62],"many":[65],"applications":[67],"like":[68],"flow":[69],"control,":[70],"maximum":[71,178],"bipartite":[72],"matching,":[73],"dominating":[75],"sets.":[76],"The":[77],"most":[78],"appealing":[79],"features":[80],"our":[82],"algorithms":[83,226,329,354],"their":[85],"simplicity":[86],"polylogarithmic":[88,326],"convergence.":[89,327],"For":[90],"LP":[93,204],"$\\max\\{c\\cdot":[94],"x\\mid":[95],"Ax\\leq":[96],"b,$":[97],"$x\\geq0\\}$,":[98],"algorithm":[100,199,319],"associates":[101],"dual":[103,215],"variable":[104],"$y_i=\\exp[\\frac{1}{\\epsilon}(\\frac{A_ix}{b_i}-1)]$":[105],"constraint":[108],"i,":[109],"j":[113],"iteratively":[114],"increases":[115],"(resp.,":[116,126],"decreases)":[117],"$x_j$":[118],"multiplicatively":[119],"if":[120],"$A_j^\\top":[121],"y$":[122],"too":[124],"small":[125],"large)":[127],"as":[128,167,189,211,334],"compared":[129],"$c_j$.":[131],"algorithm,":[133],"starting":[134],"from":[135,347,365],"feasible":[137],"solution,":[138],"always":[139],"maintains":[140],"feasibility":[141],"computes":[143],"$(1+\\epsilon)$":[145],"approximation":[146],"$\\mathrm{poly}(\\frac{\\ln(mn\\cdot":[148],"A_{\\max})}{\\epsilon})$":[149],"rounds.":[150],"Here":[151],"m":[152],"n":[154],"number":[156],"rows":[158],"columns":[160],"A,":[162],"$A_{\\max}$,":[164],"also":[165],"known":[166],"\u201cwidth\u201d":[169],"LP,":[172],"ratio":[175],"minimum":[181],"taken":[184],"expression":[187],"$A_{ij}/(b_ic_j)$":[188],"pair":[191],"$i,j$":[192],"varies":[193],"over":[194],"matrix.":[196],"A":[197],"similar":[198],"works":[200],"$\\min\\{b\\cdot":[205],"y\\mid":[206],"A^\\top":[207],"y\\geq":[208],"c,$":[209],"$y\\geq0\\}$":[210],"well.":[212],"While":[213],"exponential":[214],"variables":[216],"have":[217],"been":[218],"used":[219],"several":[221],"packing/covering":[222],"programming":[224],"(LP)":[225],"before":[227],"[S.":[228],"Plotkin,":[229],"D.":[230,248],"Shmoys,":[231],"E.":[233,285,302],"Tardos,":[234],"Math.":[235],"Oper.":[236],"Res.,":[237],"20":[238],"(1995),":[239],"pp.":[240,271,282],"257\u2013301;":[241],"Y.":[242],"Bartal,":[243],"J.":[244,264,267,277],"W.":[245],"Byers,":[246],"Raz,":[249],"Proceedings":[250,287,304],"IEEE":[253,290,307],"Symposium":[254,291,308],"on":[255,292,309,339],"Foundations":[256,293,310],"Computer":[258,295,312],"Science,":[259,296,313],"1997;":[260],"N.":[261,284,301],"Garg":[262],"K\u00f6nemann,":[265],"SIAM":[266,276],"Comput.,":[268],"37":[269],"(2007),":[270],"630\u2013652;":[272],"L.":[273],"K.":[274],"Fleischer,":[275],"Discrete":[278],"Math.,":[279],"13":[280],"(2000),":[281],"505\u2013520;":[283],"Young,":[286,303],"2001;":[297],"C.":[298],"Koufogiannakis":[299],"2007],":[314],"this":[315],"first":[318],"both":[322],"can":[330],"be":[331],"thought":[332],"applying":[335],"gradient":[337],"descent/ascent":[338],"carefully":[341],"chosen":[342],"potential.":[343],"analysis":[345],"differs":[346],"previous":[350],"multiplicative":[351],"update":[352],"based":[353],"argues":[356],"that":[357],"while":[358],"solution":[361],"far":[363],"away":[364],"optimality,":[366],"potential":[368],"function":[369],"decreases/increases":[370],"significant":[373],"factor.":[374]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}