{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T21:51:06Z","timestamp":1791150666691,"version":"4.1.0"},"reference-count":11,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2010,1]]},"abstract":"<jats:p>We design and analyze a fully distributed algorithm for convex constrained optimization in networks without any consistent naming infrastructure. The algorithm produces an approximately feasible and near-optimal solution in time polynomial in the network size, the inverse of the permitted error, and a measure of curvature variation in the dual optimization problem. It blends, in a novel way, gossip-based information spreading, iterative gradient ascent, and the barrier method from the design of interior-point algorithms.<\/jats:p>","DOI":"10.1137\/080743706","type":"journal-article","created":{"date-parts":[[2010,10,28]],"date-time":"2010-10-28T18:09:04Z","timestamp":1288289344000},"page":"3260-3279","source":"Crossref","is-referenced-by-count":24,"title":["Fully Distributed Algorithms for Convex Optimization Problems"],"prefix":"10.1137","volume":"20","author":[{"given":"Damon","family":"Mosk-Aoyama","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tim","family":"Roughgarden","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Devavrat","family":"Shah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2010,10,28]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700379383"},{"key":"R2","unstructured":"D. P. Bertsekas and J. N. Tsitsiklis,\n                      Parallel and Distributed Computation: Numerical Methods\n                      , 2nd ed., Prentice-Hall, Upper Saddle River, NJ, 1989."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"S. Boyd and L. Vandenberghe,\n                      Convex Optimization\n                      , Cambridge University Press, Cambridge, UK, 2004.","DOI":"10.1017\/CBO9780511804441"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093711"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"N. Garg and N. E. Young,\n                      On-line end-to-end congestion control\n                      , in Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, IEEE, Washington, DC, 2002, pp. 303\u2013312.","DOI":"10.1109\/SFCS.2002.1181953"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600523"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"M. Luby and N. Nisan,\n                      A parallel approximation algorithm for positive linear programming\n                      , in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 448\u2013457.","DOI":"10.1145\/167088.167211"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924648"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"C. H. Papadimitriou and M. Yannakakis,\n                      Linear programming without the matrix\n                      , in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 121\u2013129.","DOI":"10.1145\/167088.167127"},{"key":"R10","unstructured":"R. T. Rockafellar,\n                      Network Flows and Monotropic Optimization\n                      , John Wiley & Sons, New York, 1984."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"R. Srikant,\n                      The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)\n                      , Birkh\u00e4user Boston, Boston, 2004.","DOI":"10.1007\/978-0-8176-8216-3"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/080743706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:20:18Z","timestamp":1787332818000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/080743706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["10.1137\/080743706"],"URL":"https:\/\/doi.org\/10.1137\/080743706","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}