FULLY DISTRIBUTED ALGORITHMS FOR CONVEX OPTIMIZATION PROBLEMS

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...

Full description

Bibliographic Details
Main Authors: Mosk-Aoyama, Damon (Author), Roughgarden, Tim (Author), Shah, Devavrat (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor)
Format: Article
Language:English
Published: Society for Industrial and Applied Mathematics (SIAM), 2011-07-29T21:17:19Z.
Subjects:
Online Access:Get fulltext