Abstract
Motivated by modern large-scale information processing problems in engineering, this paper concentrates on studying distributed constrained convex optimization problems over a connected undirected network. The problem involves a sum of a differentiable convex function with Lipschitz continuous gradient and two non-smooth convex functions with a linear operator. To solve such a problem, we propose a novel distributed primal-dual forward-backward splitting algorithm, called D-PDFBS. Each agent locally computes the Lipschitz continuous gradient and two proximal operators, and exchanges information with its neighbors. D-PDFBS adopts non-identical stepsizes, and we reveal the relationship between selection of stepsizes and parameters of objective functions. The simulation results verify the feasibility of D-PDFBS and the correctness of theoretical findings.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Emerging Topics in Computational Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
