Primal-Dual Subgradient Algorithm for Distributed Constraint Optimization Over Unbalanced Digraphs
This paper investigates the distributed convex optimization problem with coupled inequality constraints over unbalanced digraphs depicted as row-stochastic matrices, where each agent in the network only has access to its local information, while the local constraint functions of all the agents are c...
Main Authors: | Qing Yang, Gang Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8746115/ |
Similar Items
-
Distributed Primal-Dual Perturbation Algorithm Over Unbalanced Directed Networks
by: Hiroaki Sakuma, et al.
Published: (2021-01-01) -
Interior-Point Algorithms Based on Primal-Dual
Entropy
by: Luo, Shen
Published: (2006) -
Interior-Point Algorithms Based on Primal-Dual
Entropy
by: Luo, Shen
Published: (2006) -
A Novel Learned Primal-Dual Network for Image Compressive Sensing
by: Chaolong Zhang, et al.
Published: (2021-01-01) -
On chordal digraphs and semi-strict chordal digraphs
by: Ye, Ying Ying
Published: (2019)