LAUSR

This paper considers the networked system optimization problem by cooperatively finding an approximately optimal solution to the overall network convex cost function, which is the sum of the individual cost functions of nodes (agents) in a networked system. A new distributed gradient descent algorithm is proposed based on the distributed estimation of the sum of gradients of individual cost functions using a consensus-type coordination algorithm. The proposed algorithm can address unknown directed communication topologies and only requires limited communications and information exchanges among nodes in the networked system. Under the assumption that the communication graph is strongly connected, the convergence of the proposed algorithm is rigorously analyzed. Simulation examples are presented to demonstrate the applicability and effectiveness of the proposed algorithm.