A Unifying Approximate Method of Multipliers for Distributed Composite Optimization

This article investigates solving convex composite optimization on an undirected network, where each node, privately endowed with a smooth component function and a nonsmooth one, is required to minimize the sum of all the component functions throughout the network. To address such a problem, a general approximate method of multipliers (AMM) is developed, which attempts to approximate the method of multipliers by virtue of a surrogate function with numerous options. We then design the possibly nonseparable, time-varying surrogate function in various ways, leading to different distributed realizations of AMM. We demonstrate that AMM generalizes more than ten state-of-the-art distributed optimization algorithms, and certain specific designs of its surrogate function result in a variety of new algorithms to the literature. Furthermore, we show that AMM is able to achieve an O(1/k) rate of convergence to optimality, and the convergence rate becomes linear when the problem is locally restricted strongly convex and smooth. Such convergence rates provide new or stronger convergence results to many prior methods that can be viewed as specializations of AMM.

Automated summary

This article investigates solving convex composite optimization on an undirected network, where each node is required to minimize the sum of all the component functions throughout the network. A general approximate method of multipliers (AMM) is developed to address this problem by approximating the method of multipliers using a surrogate function. Different distributed realizations of AMM are obtained by designing the surrogate function in various ways. The convergence rates of AMM provide new or stronger convergence results compared to many prior methods.