.png){kind=icon}
.png){kind=icon}
Return
Distributed Optimization With Global Constraints Using Noisy Measurements
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2023.3277312.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a new distributed optimization algorithm for solving a class of constrained optimization problems in which the objective function is separable (i.e., the sum of local objective functions of agents), the optimization variables of distributed agents, which are subject to nontrivial local constraints, are coupled by global constraints, and only noisy observations are available to estimate (the gradients of) local objective functions. In many practical scenarios, agents may not be willing to share their optimization variables with others. For this reason, we propose a distributed algorithm that does not require the agents to share their optimization variables with each other; instead, each agent maintains a local estimate of the global constraint functions and shares the estimate only with its neighbors. These local estimates of constraint functions are updated using a consensus-type algorithm, whereas the local optimization variables of each agent are updated using a first-order method based on noisy estimates of gradient. We prove that, when the agents adopt the proposed algorithm, their optimization variables converge with probability 1 to an optimal point of an approximated problem based on the penalty method.
Keywords:
Distributed optimization
penalty method
stochastic optimization
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W