Equilibrium programming in Hilbert spaces

Several methods for solving systems of equilibrium problems in Hilbert spaces – and for find-ing best approximations thereof – are presented and their convergence properties are established. The proposed methods include proximal-like block-iterative algorithms for general systems, as well as regularization and splitting algorithms for single equilibrium problems. The problem of constructing approximate equilibria in the case of inconsistent systems is also considered. 1