activity
20102023
most citedAdding Common Randomness Can Remove the Secrecy Constraints in Communication Networks

4 citations · 8 across the 4 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2022

Solving Nonsmooth Resource Allocation Problems with Feasibility Constraints through Novel Distributed Algorithms

Xiaohong Nian, Fan Li, Dongxin Liu

The distributed non-smooth resource allocation problem over multi-agent networks is studied in this paper, where each agent is subject to globally coupled network resource constrai…