Abstract
This article studies a distributed convex optimization problem with nonsmooth local objective functions subject to local inequality constraints and a coupled equality constraint. By combining the dual decomposition technique and subgradient flow method, a new distributed solution is developed in continuous time. Unlike the existing related continuous-time schemes either depending on specific initial conditions or on differentiability or strict (even strong) convexity of local cost functions, this study is free of initialization and takes into account general convex local objective functions which could be nonsmooth. Via nonsmooth analysis and set-valued LaSalle invariance principle, it is proved that a global optimal solution can be asymptotically obtained. Finally, the effectiveness of our algorithm is illustrated by numerical examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.