.png){kind=icon}
Return
Distributed Primal-Dual Splitting Algorithm for Multiblock Separable Optimization Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2021.3116116.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article considers the distributed structured optimization problem of collaboratively minimizing the global objective function composed of the sum of local cost functions. Each local objective function involves a Lipschitz-differentiable convex function, a nonsmooth convex function, and a linear composite nonsmooth convex function. For such problems, we derive the synchronous distributed primal-dual splitting (S-DPDS) algorithm with uncoordinated stepsizes. Meanwhile, we develop the asynchronous version of the algorithm in light of the randomized block-coordinate method (A-DPDS). Further, the convergence results show the relaxed range and concise form of the acceptable parameters, which indicates that the algorithms are conducive to the selection of parameters in practical applications. Finally, we demonstrate the efficiency of S-DPDS and A-DPDS algorithms by numerical experiments.
Keywords:
Optimization
Convex functions
Distributed algorithms
Convergence
Linear programming
Couplings
Simulation
Asynchronous algorithm
distributed optimization
primal-dual splitting algorithm
uncoordinated stepsizes
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveA Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
OAAI
OAAIShareSaveElectrochromic 2,4,6-triphenyl-1,3,5-triazine based esters with electron donor-acceptor structure
PREAI
ShareSaveShareSave
ShareSave
View more