.png){kind=icon}
Return
Gossip-based asynchronous algorithms for distributed composite optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2024.128952.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The distributed composite optimization problem associated a multi-agent network is investigated in this paper. Different from conventional optimization issues, the cost function of composite optimization consists of a convex function and a regularization function (possibly nonsmooth). The gossip protocol is also introduced to enhance the robustness of the network, and a gossip-based distributed composite mirror descent algorithm is presented to deal with the previous problem, which adopts the asynchronous communication method. Moreover, the algorithm performance is analyzed and the theoretical results on the corresponding error bounds are obtained. Finally, the distributed logistic regression is provided as an example to validate the practicability of the proposed algorithm.
Keywords:
Asynchronous algorithm
Composite optimization
Distributed optimization
Gossip protocol
Mirror descent
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveDifferentially private distributed online optimization via push-sum one-point bandit dual averaging.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSaveDistributed quadratic optimization with terminal consensus iterative learning strategyNEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSaveA conserved infection pathway for filamentous bacteriophages is suggested by the structure of the membrane penetration domain of the minor coat protein g3p from phage fdStructure
OAAI
StructureIF0
OAAIShareSave
ShareSave
View more