3 citations · 3 across the 1 of their papers we have counts for
3 papers
math.OC2021★ 3 cited
Efficient algorithm for approximating Nash equilibrium of distributed aggregative games
Gehui Xu, Guanpu Chen, Hongsheng Qi +1
In this paper, we aim to design a distributed approximate algorithm for seeking Nash equilibria of an aggregative game. Due to the local set constraints of each player, projectionb…
math.OC2021
Distributed Mirror Descent Algorithm with Bregman Damping for Nonsmooth Constrained Optimization
Guanpu Chen, Weijian Li, Gehui Xu +1
To solve distributed optimization efficiently with various constraints and nonsmooth functions, we propose a distributed mirror descent algorithm with embedded Bregman damping, as…
math.OC2019
Distributed sub-optimal resource allocation via a projected form of singular perturbation
Shu Liang, Xianlin Zeng, Guanpu Chen +1
Distributed optimization for resource allocation problems is investigated and a sub-optimal continuous-time algorithm is proposed. Our algorithm has lower order dynamics than other…