Abstract
Distributed optimization is an important and practical problem that arose from machine learning, smart grid, and multi-robot systems. In this paper, we propose a zeroth-order gradient tracking method to solve a class of constrained distributed optimization problems with nonidentical feasible sets. We design a more general pseudo-gradient estimation scheme, which includes the existing coordinate descent, discretized gradient descent, and spherical smoothing methods as its special cases. Moreover, we propose pseudo-gradient tracking with projection dynamics to deal with nonidentical feasible set constraints and achieve the optimal solution. We show the proposed algorithm achieves the optimal solution with an O(lnT/√T) convergence rate. Finally, we present an example to demonstrate the effectiveness of the proposed algorithm.
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.
