Abstract

We study nonconvex distributed optimization in multi-agent networks. We introduce a novel algorithmic framework for the distributed minimization of the sum of a smooth (possibly nonconvex) function-the agents' sum-utility-plus a convex (possibly nonsmooth) regularizer. The proposed method hinges on successive convex approximation (SCA) techniques while leveraging dynamic consensus as a mechanism to distribute the computation among the agents. Asymptotic convergence to (stationary) solutions of the nonconvex problem is established. Numerical results show that the new method compares favorably to existing algorithms on both convex and nonconvex problems.

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 call

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.