Fully Distributed Algorithms for Convex Optimization Problems

DOI10.1137/080743706zbMath1211.90171OpenAlexW2003208028MaRDI QIDQ5894171

Damon Mosk-Aoyama, Devavrat Shah, Tim Roughgarden

Publication date: 21 March 2011

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/64996

zbMATH Keywords

convex optimizationdistributed algorithmsgradient ascent

Mathematics Subject Classification ID

Convex programming (90C25) Distributed algorithms (68W15)

Related Items (5)

A centre–free approach for resource allocation with lower bounds ⋮ Distributed Algorithms with Finite Data Rates that Solve Linear Equations ⋮ Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding ⋮ A flexible distributed framework for realising electric and plug-in hybrid vehicle charging policies ⋮ Beep-and-sleep: message and energy efficient set cover

This page was built for publication: Fully Distributed Algorithms for Convex Optimization Problems