Randomized dual proximal gradient for large-scale distributed optimization
Randomized dual proximal gradient for large-scale distributed optimization
In this paper we consider distributed optimization problems in which the cost function is separable (i.e., a sum of possibly non-smooth functions all sharing a common variable) and can be split into a strongly convex term and a convex one. The second term is typically used to encode constraints or …