Fully Distributed Algorithms for Convex Optimization Problems

@article{MoskAoyama2010FullyDA,
  title={Fully Distributed Algorithms for Convex Optimization Problems},
  author={Damon Mosk-Aoyama and Tim Roughgarden and Devavrat Shah},
  journal={SIAM Journal on Optimization},
  year={2010},
  volume={20},
  pages={3260-3279}
}
Motivated by resource allocation in ad hoc and mobile networ ks, we design and analyze a fully distributed algorithm for convex constrained optimizatio n n networks without any consistent naming infrastructure. The algorithm produces an approximately f asible 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, g ossip-based information spreading… CONTINUE READING
Highly Cited
This paper has 41 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Fast

  • Y. Bartal, J. W. Byers, D. Raz
  • distributed approximation algorithms for positive…
  • 2004
Highly Influential
4 Excerpts

Convex Optimization

  • S. Boyd, L. Vandenberghe
  • Cambridge University Press
  • 2004
1 Excerpt

The Mathematics of Internet Congestion Control

  • R. Srikant
  • Birkhäuser
  • 2004
2 Excerpts

Similar Papers

Loading similar papers…