Gossip-based asynchronous algorithms for distributed composite optimization

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 pro...

Full description

Saved in:
Bibliographic Details
Published in:Neurocomputing (Amsterdam) Vol. 616; p. 128952
Main Authors: Fang, Xianju, Zhang, Baoyong, Yuan, Deming
Format: Journal Article
Language:English
Published: Elsevier B.V 01.02.2025
Subjects:
ISSN:0925-2312
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first