In this article, we study the problem of minimizing sum potentially nondifferentiable convex cost functions with partially overlapping dependences in an asynchronous manner, where communication network is not coordinated. We behavior algorithm based on dual decomposition and block coordinate subgradient methods under assumptions weaker than those used literature. At same time, allow different a...