This paper investigates the continuous-time distributed optimization of a sum of cost functions over directed graphs. Compared with the existing works on distributed optimization, the communication graph is not needed to be balanced. Beside, the gradient of each local cost function is only required to be continuous, whose requirement is relaxed. Finally, a simulation example is given to illustrate the effectiveness of the proposed protocol.
Zhiyong YuShuzhen YuHaijun JiangXuehui Mei
Dong WangYangwei ChenVijay GuptaJie Lian
Dong WangZhu WangMingfei ChenW. Wang
Tingting ZhouHuaiqin WuJinde Cao