A Distributed, Asynchronous and Incremental Algorithm for Nonconvex Optimization: An ADMM Based Approach
Mingyi Hong

TL;DR
This paper introduces a novel asynchronous ADMM algorithm for nonconvex, nonsmooth optimization that operates in a distributed, incremental manner, tolerating high asynchrony levels and handling nonconvexity.
Contribution
It presents the first ADMM algorithm capable of managing both nonconvexity and high asynchrony simultaneously in a distributed setting.
Findings
Converges to stationary solutions under bounded asynchrony.
Handles heterogeneity and unreliable communication links.
Tolerates higher asynchrony than existing ADMM variants.
Abstract
The alternating direction method of multipliers (ADMM) has been popular for solving many signal processing problems, convex or nonconvex. In this paper, we study an asynchronous implementation of the ADMM for solving a nonconvex nonsmooth optimization problem, whose objective is the sum of a number of component functions. The proposed algorithm allows the problem to be solved in a distributed, asynchronous and incremental manner. First, the component functions can be distributed to different computing nodes, who perform the updates asynchronously without coordinating with each other. Two sources of asynchrony are covered by our algorithm: one is caused by the heterogeneity of the computational nodes, and the other arises from unreliable communication links. Second, the algorithm can be viewed as implementing an incremental algorithm where at each step the (possibly delayed) gradients of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Power Line Communications and Noise · Blind Source Separation Techniques
