.png){kind=icon}
Return
Distributed projection-free algorithm for constrained aggregative optimization
.png){kind=icon}
OA
AI
DOI：10.1002/rnc.6640.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we focus on solving a distributed convex aggregative optimization problem in a network, where each agent has its own cost function which depends not only on its own decision variables but also on the aggregated function of all agents' decision variables. The decision variable is constrained within a feasible set. In order to minimize the sum of the cost functions when each agent only knows its local cost function, we propose a distributed Frank-Wolfe algorithm based on gradient tracking for the aggregative optimization problem where each node maintains two estimates, namely an estimate of the sum of agents' decision variable and an estimate of the gradient of global function. The algorithm is projection-free, but only involves solving a linear optimization to get a search direction at each step. We show the convergence of the proposed algorithm for convex and smooth objective functions over a time-varying network. Finally, we demonstrate the convergence and computational efficiency of the proposed algorithm via numerical simulations.
Keywords:
aggregative optimization
distributed algorithm
gradient projection-free
time-varying graph
Journal
IF:
3.2
Papers:
7.0K
Citations:
1.4W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShort-term strength training improves muscle quality and functional capacity of elderly women.png)
AGEOAAI
AGEIF0
OAAIShareSave
View more