Abstract
This paper aims at the distributed computation for semi-definite programming (SDP) problems over multi-agent networks. Two SDP problems, including a non-sparse case and a sparse case, are transformed into distributed optimization problems, respectively, by fully exploiting their structures and introducing consensus constraints. Inspired by primal–dual and consensus methods, we propose two distributed algorithms for the two cases with the help of projection and derivative feedback techniques. Furthermore, we prove that the algorithms converge to their optimal solutions, and moreover, their convergences rates are evaluated by the duality gap.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have