Fast Algorithms for Distributed Optimization and Hypothesis Testing: A Tutorial

2016/09/13 by Olshevsky, Alex
#FOS: Mathematics #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.1609.03961

Abstract

We consider several problems in the field of distributed optimization and hypothesis testing. We show how to obtain convergence times for these problems that scale linearly with the total number of nodes in the network by using a recent linear-time algorithm for the average consensus problem.

Related

• Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
• Convergence Speed in Distributed Consensus and Control
• Distributed Optimization, Averaging via ADMM, and Network Topology
• Communication-Efficient Algorithms For Distributed Optimization
• Optimal algorithms for smooth and strongly convex distributed optimization in networks