Exponentially Convergent Algorithm Design for Constrained Distributed Optimization via Nonsmooth Approach

Abstract

We develop an exponentially convergent distributed algorithm to minimize a sum of nonsmooth cost functions with a set constraint. The set constraint generally leads to the nonlinearity in distributed algorithms, and results in difficulties to derive an exponential rate. In this article, we remove the consensus constraints by an exact penalty method, and then propose a distributed projected subgradient algorithm by virtue of a differential inclusion and a differentiated projection operator. Resorting to nonsmooth approaches, we prove the convergence for this algorithm, and moreover, provide both the sublinear and exponential rates under some mild assumptions.

Topics & Concepts