Algorithms for approximating minimization problems in Hilbert spaces

https://doi.org/10.1016/j.cam.2010.10.055Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper, we study the following minimization problem minxFix(S)Ωμ2Bx,x+12x2h(x), where B is a bounded linear operator, μ0 is some constant, h is a potential function for γ̄f, Fix(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.

MSC

49J40
47H10
47H17
49M05
90C25
90C99

Keywords

Nonexpansive mapping
Monotone mapping
Fixed point
Equilibrium problem
Variational inequality
Minimization problem

Cited by (0)