A projected subgradient algorithm for bilevel equilibrium problems and applications
A new computational method is proposed to solve bilevel equilibrium problems in a real Hilbert space. The algorithm is designed such that subgradients of two convex functions and one projection onto a convex set are computed at each iteration. As consequence, the procedure provided by the authors has a low computational cost. Some numerical experiments illustrate the convergence of the algorithm. The procedure is particularized on the equilibrium problem over a fixed point set.
scientific article; zbMATH DE number 6819191
scientific article