Gradient approach of computing fixed points of equilibrium problems
From MaRDI portal
Publication:1810865
DOI10.1023/A:1020321209606zbMath1056.91001OpenAlexW1559058103MaRDI QIDQ1810865
Publication date: 9 June 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1020321209606
Noncooperative games (91A10) Minimax problems in mathematical programming (90C47) Existence of solutions for minimax problems (49J35)
Related Items
Error bounds and stability of the projection method for strongly pseudomonotone equilibrium problems ⋮ On some properties of Nash equilibrium points in two-person games ⋮ Splitting extragradient-like algorithms for strongly pseudomonotone equilibrium problems ⋮ Terminal control of boundary models ⋮ One-step optimization method for equilibrium problems ⋮ Dynamical systems for solving variational inequalities ⋮ An iterative algorithm for a general system of variational inequalities and fixed point problems in \(q\)-uniformly smooth Banach spaces ⋮ Two modified extragradient algorithms for solving variational inequalities ⋮ A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints ⋮ A splitting algorithm for equilibrium problem given by the difference of two bifunctions ⋮ Two-person game with Nash equilibrium in optimal control problems ⋮ Approximate calculation of Nash equilibria for two-person games ⋮ CONTRACTION-MAPPING ALGORITHM FOR THE EQUILIBRIUM PROBLEM OVER THE FIXED POINT SET OF A NONEXPANSIVE SEMIGROUP ⋮ Extra-proximal methods for solving two-person nonzero-sum games ⋮ Robust Power Management via Learning and Game Design ⋮ An adaptive proximal method for variational inequalities ⋮ A gradient-like regularized dynamics for monotone equilibrium problems
This page was built for publication: Gradient approach of computing fixed points of equilibrium problems
