A numerical algorithm for finding solutions of a generalized Nash equilibrium problem
- 301 Downloads
A family of nonempty closed convex sets is built by using the data of the Generalized Nash equilibrium problem (GNEP). The sets are selected iteratively such that the intersection of the selected sets contains solutions of the GNEP. The algorithm introduced by Iusem-Sosa (Optimization 52:301–316, 2003) is adapted to obtain solutions of the GNEP. Finally some numerical experiments are given to illustrate the numerical behavior of the algorithm.
KeywordsConvex feasibility problem Generalized Nash equilibrium problem Projection methods
Unable to display preview. Download preview PDF.