Distributed Continuous-Time Nonsmooth Convex Optimization With Coupled Inequality Constraints

摘要

This paper studies distributed convex optimization problems over continuous-time multiagent networks subject to two types of constraints, i.e., local feasible set constraints and coupled inequality constraints, where all involved functions are not necessarily differentiable, only assumed to be convex. In order to solve this problem, a modified primal-dual continuous-time algorithm is proposed by projections on local feasible sets. With the aid of constructing a proper Lyapunov function candidate, the existence of solutions of the algorithm in the Caratheodory sense and the convergence of the algorithm to an optimal solution for the distributed optimization problem are established. Additionally, a sufficient condition is provided for making the algorithm fully distributed. Finally, the theoretical result is corroborated by a simulation example.