Interior proximal extragradient method for equilibrium problems.

The Bregman function-based Proximal Point Algorithm (BPPA) is an efficient tool for solving equilibrium problems and fixed-point problems. Extending rather classical proximal regularization methods, the main additional feature consists in an application of zone coercive regularizations. The latter allows to treat the generated subproblems as unconstrained ones, albeit with a certain precaution in numerical experiments. However, compared to the (classical) Proximal Point Algorithm for equilibrium problems, convergence results require additional assumptions which may be seen as the price to pay for unconstrained subproblems. Unfortunately, they are quite demanding – for instance, as they imply a sort of unique solvability of the given problem. The main purpose of this paper is to develop a modification of the BPPA, involving an additional extragradient step with adaptive (and explicitly given) stepsize. We prove that this extragradient step allows to leave out any of the additional assumptions mentioned above. Hence, though still of interior proximal type, the suggested method is applicable to an essentially larger class of equilibrium problems, especially including non-uniquely solvable ones. [ABSTRACT FROM AUTHOR]