solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看7346次
A geometrically converging dual method for distributed optimization over time-varying graphs. (arXiv:1810.05760v1 [math.OC])
来源于:arXiv
In this paper we consider a distributed convex optimization problem over
time-varying undirected networks. We propose a dual method, primarily averaged
network dual ascent (PANDA), that is proven to converge R-linearly to the
optimal point given that the agents objective functions are strongly convex and
have Lipschitz continuous gradients. Like dual decomposition, PANDA requires
half the amount of variable exchanges per iterate of methods based on DIGing,
and can provide with practical improved performance as empirically
demonstrated. 查看全文>>