Algorithms for approximating minimization problems in Hilbert spaces

In this paper, we study the following minimization problem min x ∈ F i x ( S ) ∩ Ω μ 2 〈 B x , x 〉 + 1 2 ‖ x ‖ 2 − h ( x ) , where B is a bounded linear operator, μ ≥ 0 is some constant, h is a potential function for γ ̄ f , F i x ( T ) is the set of fixed points of nonexpansive mapping S and Ω is the solution set of an equilibrium problem. This paper introduces two new algorithms (one implicit and one explicit) that can be used to find the solution of the above minimization problem.