.png){kind=icon}
.png){kind=icon}
Return
A distributed algorithm for solving mixed equilibrium problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2019.03.015.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, the mixed equilibrium problem is solved by a multi-agent network. The objective for agents is to cooperatively find a point in a convex set, at which the sum of some local bifunctions with a free variable is non-negative. To address this problem, we propose a distributed extragradient algorithm based on a consensus strategy. By implementing the algorithm, each agent adjusts its state value by only using its own bifunction information and the local state information received from its immediate neighbors. Under mild conditions on the graph and bifunctions, it is shown that all agents reach agreement asymptotically, and the consensus state is a solution to the equilibrium problem. A simulation example is presented to demonstrate the effectiveness of our theoretical results. (C) 2019 Elsevier Ltd. All rights reserved.
Keywords:
Multi-agent network
Consensus
Equilibrium problems
Distributed optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W