Abstract
This article addresses the continuous-time distributed optimization of a strictly convex summation-separable cost function with possibly nonconvex local functions over strongly connected digraphs. Distributed optimization methods in the literature require convexity of local functions, or balanced weights, or vanishing step sizes, or algebraic information (eigenvalues or eigenvectors) of the Laplacian matrix. The solution proposed here covers both weight-balanced and unbalanced digraphs in a unified way, without any of the aforementioned requirements.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
