A fixed-time optimal consensus algorithm over undirected networks

This paper proposes a distributed and continuous fixed-time convergence algorithm to solve a fixed-topology network optimization problem with the global cost function being the sum of strictly convex local cost functions of each node. The algorithm proposed in this paper is inspired by the fixed-time consensus theory and continuous-time zero- gradient-sum algorithm. In comparison with the finite-time convergence result in the existing work, a priori specified convergence time can be guaranteed regardless of the initial conditions of our algorithm. A simulation example is provided to verify the effectiveness of the proposed algorithm.