FULLY DISTRIBUTED ALGORITHMS FOR CONVEX OPTIMIZATION PROBLEMS

FULLY DISTRIBUTED ALGORITHMS FOR CONVEX OPTIMIZATION PROBLEMS

Pokaži ostale verzije (1)

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

Cijeli opis

Bibliografski detalji
Glavni autori: Mosk-Aoyama, Damon, Roughgarden, Tim, Shah, Devavrat
Daljnji autori: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Članak
Jezik:en_US
Izdano: Society for Industrial and Applied Mathematics (SIAM) 2011
Online pristup:http://hdl.handle.net/1721.1/64996
https://orcid.org/0000-0003-0737-3259

Internet

http://hdl.handle.net/1721.1/64996
https://orcid.org/0000-0003-0737-3259

Slični predmeti