Abstract
AbstractThis paper investigates a distributed online optimization problem with convex objective functions on time‐varying directed networks, where each agent holds its own convex cost function and the goal is to cooperatively minimize the sum of the local cost functions. To tackle such optimization problems, an accelerated distributed online gradient push‐sum algorithm is firstly proposed, which combines the momentum acceleration technique and the push‐sum strategy. Then, we specifically analyze the regret for the proposed algorithm. The theoretical result shows that the individual regret of the proposed algorithm achieves a sublinear regret with order of , where T is the time horizon. Moreover, we implement the proposed algorithm in sensor networks for solving the distributed online estimation problem, and the results illustrate the effectiveness of the proposed algorithm.
Published Version (
Free)
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.
