.png){kind=icon}
.png){kind=icon}
Return
A Distributed, Asynchronous, and Incremental Algorithm for Nonconvex Optimization: An ADMM Approach
.png){kind=icon}
OA
AI
DOI：10.1109/TCNS.2017.2657460.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 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, which 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 only a subset of component functions are updated. We show that when certain bounds are imposed on the level of asynchrony, the proposed algorithm converges to the set of stationary solutions (resp. optimal solutions) for the nonconvex (resp. convex) problem, with a global sublinear rate.
Keywords:
Alternating directionmethod of multipliers
asynchronous optimization
distributed optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5
Papers:
1.6K
Citations:
5.8K