Accelerated Multi-agent optimization method over stochastic networks
Tipus de documentText en actes de congrés
Data publicació2020
EditorInstitute of Electrical and Electronics Engineers (IEEE)
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
We propose a distributed method to solve a multi-agent optimization problem with strongly convex cost function and equality coupling constraints. The method is based on Nesterov’s accelerated gradient approach and works over stochastically time-varying communication networks. We consider the standard assumptions of Nesterov’s method and show that the sequence of the expected dual values converge toward the optimal value with the rate of O(1/k²). Furthermore, we provide a simulation study of solving an optimal power flow problem with a well-known benchmark case.
Descripció
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting /republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works
CitacióAnanduta, W.; Ocampo-Martinez, C.; Nedic, A. Accelerated Multi-agent optimization method over stochastic networks. A: IEEE Conference on Decision and Control. "IEEE Conference on Decision and Control 2020 (CDC20)". Institute of Electrical and Electronics Engineers (IEEE), 2020, p. 2961-2966. DOI 10.1109/CDC42340.2020.9304307.
Versió de l'editorhttps://ieeexplore.ieee.org/document/9304307
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
2393-Accelerate ... -Stochastic-Networks-1.pdf | 1,178Mb | Visualitza/Obre |