Finite-Time Consensus of Opinion Dynamics and its Applications to Distributed Optimization Over Digraph

In this paper, some efficient criteria for finite-time consensus of a class of nonsmooth opinion dynamics over a digraph are established. The lower and upper bounds on the finite settling time are obtained based respectively on the maximal and minimal cut capacity of the digraph. By using tools of the nonsmooth theory and algebraic graph theory, the Carathéodory and Filippov solutions of nonsmooth opinion dynamics are analyzed and compared in detail. In the sense of Filippov solutions, the dynamic consensus is demonstrated without a leader and the finite-time bipartite consensus is also investigated in a signed digraph correspondingly. To achieve a predetermined consensus, a leader agent is introduced to the considered agent networks. As an application, the nonsmooth compartmental dynamics in the presence of a leader is embedded in the proposed continuous-time protocol to solve the distributed optimization problems over an unbalanced digraph. The convergence to the optimal solution by using the proposed distributed algorithm is guaranteed with appropriately selected parameters. To verify the effectiveness of the proposed protocols, three numerical examples are performed.