Fully Distributed Algorithms for Convex Optimization Problems

DOI10.1007/978-3-540-75142-7_41MaRDI QIDQ5900272zbMATH OpenOpenAlexFDO

Authors Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah

Publication date 2 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Fully distributed algorithms for convex optimization problems
• Primal-dual stochastic distributed algorithm for constrained convex optimization
• Distributed stochastic subgradient projection algorithms for convex optimization
• Continuous-time algorithm design for distributed constrained optimization over weight-balanced directed networks
• Distributed convex optimization with coupling constraints over time-varying directed graphs

Cited in

(11)

• Fully distributed algorithms for convex optimization problems
• Distributed Bregman-distance algorithms for min-max optimization
• Multiuser optimization: distributed algorithms and error analysis
• Distributed convex thresholding
• Approximations in Distributed Optimization
• Distributed consensus-based solver for semi-definite programming: an optimization viewpoint
• A distributed optimization algorithm in connection-less networks
• Distributed Algorithm for Solving Convex Inequalities
• Algorithm implementation for distributed convex intersection computation
• Distributed random convex programming via constraints consensus
• Fast Distributed Algorithms Via Primal-Dual (Extended Abstract)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900272)