Abstract
We consider a multi-agent convex optimization problem where the agents are to minimize a sum of local objective functions subject to a global inequality constraint, a global equality constraint and a global constraint set. We devise a distributed primal-dual subgradient algorithm which is based on the characterization of the primal-dual optimal solutions as the saddle points of the penalty function. This algorithm allows the agents exchange information over networks with time-varying topologies and asymptotically agree on an optimal solution and the optimal value.
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.
