Projection-type methods are a class of simple methods for solving variational inequalities,
especially for complementarity problems. In this paper we review and summarize recent …

The proximity operator of a convex function is a natural extension of the notion of a
projection operator onto a convex set. This tool, which plays a central role in the analysis …

We propose a prototypical Split Inverse Problem (SIP) and a new variational problem, called
the Split Variational Inequality Problem (SVIP), which is a SIP. It entails finding a solution of …

Iterative methods for finding fixed points of non-expansive operators in Hilbert spaces have
been described in many publications. In this monograph we try to present the methods in a …

In this paper, we establish a strong convergence theorem regarding a regularized variant of
the projected subgradient method for nonsmooth, nonstrictly convex minimization in real …

Several methods for solving systems of equilibrium problems in Hilbert spaces–and for
finding best approximations thereof–are presented and their convergence properties are …

Based on the very recent work by Censor-Gibali-Reich (http://arxiv. org/abs/1009.3780), we
propose an extension of their new variational problem (Split Variational Inequality Problem) …

We introduce and study the Split Common Null Point Problem (SCNPP) for set-valued
maximal monotone mappings in Hilbert spaces. This problem generalizes our Split …

Recently, some primal-dual algorithms have been proposed for solving a saddle-point
problem, with particular applications in the area of total variation image restoration. This …

The split feasibility problem (SFP) consists in finding a point in a given closed convex subset
of a Hilbert space such that its image under a bounded linear operator belongs to a given …