Abstract: In this paper, the optimization problem subject to N nonidentical closed convex set constraints is studied. The aim is to design a corresponding distributed optimization algorithm over the fixed unbalanced graph to solve the considered problem. To this end, with the push-sum framework improved, the distributed optimization algorithm is newly designed, and its strict convergence analysis is given under the assumption that the involved graph is strongly connected. Finally, simulation results support the good performance of the proposed algorithm.

Key words: Distributed optimization; Nonidentical constraints; Improved push-sum framework

Please provide your name, email address and a comment

Your Name: Affili: E-Mail Address:

Comment (Please comment in English):


Verification Code(click to change a pic):