A Primal-Dual Algorithm for Distributed Stochastic Optimization with Equality Constraints

Distributed stochastic optimization problem with equality constraints over a random network with imperfect communications is considered, where the measurements of all functions to be used are subject to noises. The goal of the network is to minimize a global cost function subject to a global constra...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Chinese Control Conference s. 5586 - 5591
Hlavní autori: Du, Kai-Xin, Chen, Xing-Min
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: Technical Committee on Control Theory, Chinese Association of Automation 26.07.2021
Predmet:
almost sure convergence
Approximation algorithms
Communication networks
Convergence
Cost function
Distributed algorithms
distributed primal-dual algorithm
distributed stochastic optimization
equality constrained optimization
Linear programming
Noise measurement
stochastic approximation
ISSN:1934-1768
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Distributed stochastic optimization problem with equality constraints over a random network with imperfect communications is considered, where the measurements of all functions to be used are subject to noises. The goal of the network is to minimize a global cost function subject to a global constraint set, where the global objective is a sum of objective functions, the global constraint set is the intersection of local constraint sets with equality constraints, and each agent only has access to information on its cost function and constraint function. A primal-dual projection-free distributed algorithm is proposed to solve the problem, where each agent updates its estimates by using the local observations and local information on its neighbors' broadcast state values. Almost sure convergence of the algorithm is proven under mild conditions.
ISSN:1934-1768
DOI:10.23919/CCC52363.2021.9549801