A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
This thesis studies the distributed solutions to the coupled convex feasibility and optimization problems on agent networks, with the aim of reducing the storage and communication requirements for individual agents by exploiting the potential coupling sparsity across agents. We first focus on the convex feasibility problems. Four iterative solutions are proposed, where each agent only maintains its own variable together with its desired values for those neighboring agents whose valuations helpdoi:10.25394/pgs.11301254.v1 fatcat:cpxgpuqolnhirahbmhf6feviby