@article{journals/jmlr/RavikumarAW10,
  added-at = {2019-07-10T00:00:00.000+0200},
  author = {Ravikumar, Pradeep and Agarwal, Alekh and Wainwright, Martin J.},
  biburl = {https://www.bibsonomy.org/bibtex/2b584bac40a36ef8968a23fb69be7ad4c/dblp},
  ee = {https://dl.acm.org/citation.cfm?id=1756040},
  interhash = {85ea663a843e7f8487bf2fbc0b4706a6},
  intrahash = {b584bac40a36ef8968a23fb69be7ad4c},
  journal = {J. Mach. Learn. Res.},
  keywords = {dblp},
  pages = {1043-1080},
  timestamp = {2019-07-11T11:41:26.000+0200},
  title = {Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes.},
  url = {http://dblp.uni-trier.de/db/journals/jmlr/jmlr11.html#RavikumarAW10},
  volume = 11,
  year = 2010
}

{"_id":"Jm5K72c2ABvcdGbyi","bibbaseid":"ravikumar-agarwal-wainwright-messagepassingforgraphstructuredlinearprogramsproximalmethodsandroundingschemes-2010","authorIDs":[],"author_short":["Ravikumar, P.","Agarwal, A.","Wainwright, M. J."],"bibdata":{"bibtype":"article","type":"article","added-at":"2019-07-10T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Ravikumar"],"firstnames":["Pradeep"],"suffixes":[]},{"propositions":[],"lastnames":["Agarwal"],"firstnames":["Alekh"],"suffixes":[]},{"propositions":[],"lastnames":["Wainwright"],"firstnames":["Martin","J."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2b584bac40a36ef8968a23fb69be7ad4c/dblp","ee":"https://dl.acm.org/citation.cfm?id=1756040","interhash":"85ea663a843e7f8487bf2fbc0b4706a6","intrahash":"b584bac40a36ef8968a23fb69be7ad4c","journal":"J. Mach. Learn. Res.","keywords":"dblp","pages":"1043-1080","timestamp":"2019-07-11T11:41:26.000+0200","title":"Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes.","url":"http://dblp.uni-trier.de/db/journals/jmlr/jmlr11.html#RavikumarAW10","volume":"11","year":"2010","bibtex":"@article{journals/jmlr/RavikumarAW10,\n added-at = {2019-07-10T00:00:00.000+0200},\n author = {Ravikumar, Pradeep and Agarwal, Alekh and Wainwright, Martin J.},\n biburl = {https://www.bibsonomy.org/bibtex/2b584bac40a36ef8968a23fb69be7ad4c/dblp},\n ee = {https://dl.acm.org/citation.cfm?id=1756040},\n interhash = {85ea663a843e7f8487bf2fbc0b4706a6},\n intrahash = {b584bac40a36ef8968a23fb69be7ad4c},\n journal = {J. Mach. Learn. Res.},\n keywords = {dblp},\n pages = {1043-1080},\n timestamp = {2019-07-11T11:41:26.000+0200},\n title = {Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes.},\n url = {http://dblp.uni-trier.de/db/journals/jmlr/jmlr11.html#RavikumarAW10},\n volume = 11,\n year = 2010\n}\n\n","author_short":["Ravikumar, P.","Agarwal, A.","Wainwright, M. J."],"key":"journals/jmlr/RavikumarAW10","id":"journals/jmlr/RavikumarAW10","bibbaseid":"ravikumar-agarwal-wainwright-messagepassingforgraphstructuredlinearprogramsproximalmethodsandroundingschemes-2010","role":"author","urls":{"Link":"https://dl.acm.org/citation.cfm?id=1756040","Paper":"http://dblp.uni-trier.de/db/journals/jmlr/jmlr11.html#RavikumarAW10"},"keyword":["dblp"],"downloads":0},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/wainwright?items=1000","creationDate":"2019-07-11T17:45:21.496Z","downloads":0,"keywords":["dblp"],"search_terms":["message","passing","graph","structured","linear","programs","proximal","methods","rounding","schemes","ravikumar","agarwal","wainwright"],"title":"Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes.","year":2010,"dataSources":["9g7YFYRTAHoh4aFeS"]}