| dc.contributor.author | Mosk-Aoyama, Damon | |
| dc.contributor.author | Roughgarden, Tim | |
| dc.contributor.author | Shah, Devavrat | |
| dc.date.accessioned | 2011-07-29T21:17:19Z | |
| dc.date.available | 2011-07-29T21:17:19Z | |
| dc.date.issued | 2010-10 | |
| dc.date.submitted | 2008-12 | |
| dc.identifier.issn | 1052-6234 | |
| dc.identifier.issn | 1095-7189 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/64996 | |
| dc.description.abstract | 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. | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Society for Industrial and Applied Mathematics (SIAM) | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1137/080743706 | en_US |
| dc.rights | Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. | en_US |
| dc.source | SIAM | en_US |
| dc.title | FULLY DISTRIBUTED ALGORITHMS FOR CONVEX OPTIMIZATION PROBLEMS | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Mosk-Aoyama, Damon, Tim Roughgarden, and Devavrat Shah. “Fully Distributed Algorithms for Convex Optimization Problems.” SIAM Journal on Optimization 20.6 (2010) : 3260. © 2010 Society for Industrial and Applied Mathematics | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems | en_US |
| dc.contributor.approver | Shah, Devavrat | |
| dc.contributor.mitauthor | Shah, Devavrat | |
| dc.relation.journal | SIAM Journal on Optimization | en_US |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dspace.orderedauthors | Mosk-Aoyama, Damon; Roughgarden, Tim; Shah, Devavrat | en |
| dc.identifier.orcid | https://orcid.org/0000-0003-0737-3259 | |
| mit.license | PUBLISHER_POLICY | en_US |
| mit.metadata.status | Complete | |
