Print Email Facebook Twitter The Distributed Dual Ascent Algorithm is Robust to Asynchrony Title The Distributed Dual Ascent Algorithm is Robust to Asynchrony Author Bianchi, M. (TU Delft Team Sergio Grammatico) Ananduta, W. (TU Delft Team Sergio Grammatico) Grammatico, S. (TU Delft Team Bart De Schutter; TU Delft Team Sergio Grammatico) Date 2022 Abstract The distributed dual ascent is an established algorithm to solve strongly convex multi-agent optimization problems with separable cost functions, in the presence of coupling constraints. In this letter, we study its asynchronous counterpart. Specifically, we assume that each agent only relies on the outdated information received from some neighbors. Differently from the existing randomized and dual block-coordinate schemes, we show convergence under heterogeneous delays, communication and update frequencies. Consequently, our asynchronous dual ascent algorithm can be implemented without requiring any coordination between the agents. Subject networked control systemsOptimization algorithmsvariational methods To reference this document use: http://resolver.tudelft.nl/uuid:c66c0402-22ac-4699-a8d7-5713fe269c8b DOI https://doi.org/10.1109/LCSYS.2021.3084883 Embargo date 2021-11-28 ISSN 2475-1456 Source IEEE Control Systems Letters, 6, 650-655 Bibliographical note Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public. Part of collection Institutional Repository Document type journal article Rights © 2022 M. Bianchi, W. Ananduta, S. Grammatico Files PDF The_Distributed_Dual_Asce ... chrony.pdf 630.52 KB Close viewer /islandora/object/uuid:c66c0402-22ac-4699-a8d7-5713fe269c8b/datastream/OBJ/view