A Bregman splitting scheme for distributed optimization over networks
We consider distributed optimization problems, in which a group of agents are to collaboratively seek the global optimum through peer-to-peer communication networks. The problem arises in various application areas, such as resource allocation, sensor fusion, and distributed learning. We present a ge...
Saved in:
Main Authors: | Xu, Jinming, Zhu, Shanying, Soh, Yeng Chai, Xie, Lihua |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/145279 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Convergence of asynchronous distributed gradient methods over stochastic networks
by: Xu, Jinming, et al.
Published: (2020) -
Split bregman methods and frame based image restoration
by: Cai, J.-F., et al.
Published: (2014) -
A dual splitting approach for distributed resource allocation with regularization
by: Xu, Jinming, et al.
Published: (2020) -
STOCHASTIC BREGMAN GRADIENT-TYPE ALGORITHMS FOR NONCONVEX OPTIMIZATION AND CONVEX-CONCAVE SADDLE POINT PROBLEMS
by: DING KUANGYU
Published: (2023) -
Learning Bregman distance functions for semi-supervised clustering
by: Wu, Lei, et al.
Published: (2012)