Distributed robust adaptive equilibrium computation for generalized convex games
0209 industrial biotechnology
Optimization and Control (math.OC)
FOS: Mathematics
02 engineering and technology
Mathematics - Optimization and Control
DOI:
10.1016/j.automatica.2015.10.012
Publication Date:
2015-11-11T03:51:06Z
AUTHORS (2)
ABSTRACT
This paper considers a class of generalized convex games where each player is associated with a convex objective function, a convex inequality constraint and a convex constraint set. The players aim to compute a Nash equilibrium through communicating with neighboring players. The particular challenge we consider is that the component functions are unknown a priori to associated players. We study two distributed computation algorithms and analyze their convergence properties in the presence of data transmission delays and dynamic changes of network topologies. The algorithm performance is verified through demand response on the IEEE 30-bus Test System. Our technical tools integrate convex analysis, variational inequalities and simultaneous perturbation stochastic approximation.<br/>2 figures<br/>
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (40)
CITATIONS (105)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....