Volume 2013, Issue 1 386930
Research Article
Open Access

Inertial Iteration for Split Common Fixed-Point Problem for Quasi-Nonexpansive Operators

Yazheng Dang

Corresponding Author

Yazheng Dang

School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China usst.edu.cn

College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454000, China hpu.edu.cn

Search for more papers by this author
Yan Gao

Yan Gao

School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China usst.edu.cn

Search for more papers by this author
First published: 25 June 2013
Citations: 1
Academic Editor: Ru Dong Chen

Abstract

Inspired by the note on split common fixed-point problem for quasi-nonexpansive operators presented by Moudafi (2011), based on the very recent work by Dang et al. (2012), in this paper, we propose an inertial iterative algorithm for solving the split common fixed-point problem for quasi-nonexpansive operators in the Hilbert space. We also prove the asymptotical convergence of the algorithm under some suitable conditions. The results improve and develop previously discussed feasibility problems and related algorithms.

1. Introduction

The convex feasibility problem (CFP), as an important optimization problem [1], is to find a common point in the intersection of finitely many convex sets. It has been applied to many areas, for instance, approximation theory [2], image reconstruction from projections [3, 4], control [5], and so on. When there are only two sets and constraints are imposed on the solutions in the domain of a linear operator as well as in this operator’s ranges, the problem is said to be a split feasibility problem (SFP) which has the following formula: finding a point x satisfying
()
where C is a closed convex subset of a Hilbert space H1, Q is a closed convex subset of a Hilbert space H2, and A : H1H2 is a bounded linear operator. The SFP was originally introduced in [6], and it has also broad applications in many fields, such as image reconstruction problem, signal processing, and radiation therapy. Many projection methods have also been developed for solving the SFP; see [79]. Denote by PC the orthogonal projection onto C; that is, PC(x) = arg  min yCxy∥, over all xC. Assuming that the SFP is consistent (i.e., (1) has a solution), it is not hard to see that xC solves (1) if and only if it solves the fixed-point equation:
()
where 0 < γ is any positive constant and A* denotes the adjoint of A.
To solve (2), in [10], Byrne introduced the so-called CQ algorithm, which generates a sequence {xk} by
()
where 0 < γ < 2/ρ(ATA) and ρ(ATA) is the spectral radius of A*A.

The split common fixed-point problem (SCFP) is a generalization of the split feasibility problem (SFP) and the convex feasibility problem (CFP); see [11]. Our main purpose here is to give an extension of the results developed in [12] to the split common fixed-point problem for quasi-nonexpansive operators, and we will introduce weak symposium convergence result of the algorithm under some suitable conditions. This will be done in the context of general Hilbert spaces.

The paper is organized as follows. In Section 2, we recall some preliminaries. In Section 3, we present an inertial CQ algorithm and show its convergence.

2. Preliminaries

Throughout the rest of the paper, I denotes the identity operator and Fix (T) denotes the set of the fixed points of an operator T, that is, Fix (T): = {xx = T(x)}.

Recall that a mapping T is said to be quasi-nonexpansive (εQ) if
()
A mapping T is called nonexpansive (εN) if
()
A mapping T is called firmly nonexpansive (εFN) if
()
A mapping T is called firmly quasi-nonexpansive (εFQ) if
()
It is easily observed that εFNεNεQ and that εFNεFQεQ. Furthermore, εFN is well known to include resolvents and projection operators, while εFQ contains subgradient projection operators (see, e.g., [13], and the references therein).
Recently, Bauschke and Combettes [14] have considered a class of mappings satisfying the condition
()
It can easily be seen that the class of mappings satisfying the latter condition coincides with that of firmly quasi-nonexpansive mappings.

Usually, the convergence of fixed-point algorithms requires some additional smoothness properties of the mapping T such as demiclosedness.

Definition 1. A mapping T is said to be demiclosed if for any sequence {xk} which weakly converges to y and if the sequence {T(xk)} strongly converges to z, then T(y) = z.

In what follows, only the particular case of demiclosedness at zero will be used, which is the particular case when z = 0.

The following lemmas will be needed in the proof of the convergence of the algorithm.

Lemma 2. Let T be a quasi-nonexpansive mapping. Set Tα : = (1 − α)I + αT. Then, it is immediate that for all (x, q) ∈ H × Fix (T):

  • (1)

    xT(x), xq〉≥(1/2)∥xT(x)∥2 and 〈xT(x), qT(x)〉≤(1/2)∥xT(x)∥2;

  • (2)

    ;

  • (3)

    xTα(x), xq〉≥(α/2)∥xT(x)∥2.

Lemma 3 (see [8].)Assume φk ∈ [0, ) and δk ∈ [0, ) satisfy

  • (1)

    φk+1φkθk(φkφk−1) + δk,

  • (2)

    ,

  • (3)

    {θk}⊂[0, θ],  where θ ∈ [0,1).

Then, the sequence  {φk} is convergent with , where [t] + : = max {t, 0}  (for any tR).

3. The Inertial Algorithm and Its Asymptotic Convergence

In what follows, we will focus our attention on the following general two-operator split common fixed-point problem:
()
where A : H1H2 is a bounded linear operator and U : H1H1 and T : H2H2 are two quasi-nonexpansive operators with nonempty fixed-point sets Fix (U) = C and Fix (T) = Q, and denote the solution set of the two-operator SCFP by
()

3.1. The Inertial Algorithm

To solve (9), Moudafi [15] proposed and proved, in finite-dimensional spaces, the convergence of the following algorithm:
()
where β ∈ (0,1), αk ∈ (0,1) are relaxation parameters and γ > 0. Inspired by the inertial technique, we introduce the following inertial method and then present its convergence analysis.

Algorithm 4.

  • Initialization: Let x0H1 be arbitrary.

  • Iterative step: For kN, set u = I + γηA*(TI)A, and let

    ()

where η ∈ (0,1), αk ∈ (0,1), and γ ∈ (0,1/(λη)), with λ being the spectral radius of the operator A*A, θk ∈ [0,1).

3.2. Asymptotic Convergence of the Inertial Algorithm

In this subsection, we establish the asymptotic convergence of Algorithm 4.

Lemma 5 (Opial [16]). Let H be a Hilbert space and let {xk} be a sequence in H such that there exists a nonempty set SH satisfying

  • (1)

    for every x*, lim kxkx*∥ exists,

  • (2)

    any weak cluster point of the sequence {xk} belongs to S. Then, there exists zS such that {xk} weakly converges to z.

Theorem 6. Given a bounded linear operator A : H1H2, let U : H1H1 be a quasi-nonexpansive operator with nonempty Fix (U) = C and let T : H2H2 be a quasi-nonexpansive operator with nonempty Fix (T) = Q. Assume that UI and TI are demiclosed at 0. If Γ ≠ , then any sequence {xk} generated by Algorithm 4 weakly converges to a split common fixed point, provided that we choose θk satisfying with , θ ∈ [0,1). γ ∈ (0,1/(λη)) and αk ∈ (δ, 1 − δ) for a small enough δ > 0.

Proof. Taking z ∈ Γ, and using (2) in Lemma 2, we obtain

()
On the other hand, we have
()
that is,
()
Now, by setting υ : = 2γηAykAz, (TI)(Ayk)〉 and using (1) of Lemma 2, we obtain
()
Combining the key inequality above with (15) yields
()
Define the auxiliary real sequence . Therefore, from (17), we have
()
By deducing, we have
()
It is easy to check that .

Hence,

()
Putting (20) into (18), we get
()
Since γ ∈ (0,1/(λη)), according to , αk ∈ (0,1) and (21), we derive
()
Evidently,
()
due to . Let in Lemma 3. We deduce that the sequence {∥xkz∥} is convergent (hence, {xk} is bounded). By (23) and Lemma 3, we obtain . By reason of (21), we have
()
Hence,
()
By γ ∈ (0,1/(λη)) and the assumption on αk, we get
()
()
Denoting by x* a weak-cluster point {xk}, let be a subsequence of {xk}. Obviously,
()
Then, from (26) and the demiclosedness of TI at 0, we obtain
()
it follows that Ax*Q.

Now, by setting uk = yk + γηA*(TI)(Ayk), it follows that . By the demiclosedness of UI at 0, from (27), we have
()
Hence, x*C, and therefore x* ∈ Γ.

Since there is no more than one weak-cluster point, the weak convergence of the whole sequence {xk} follows by applying Lemma 5 with S = Γ.

Remark 7. Since the current value of ∥xkxk−1∥ is known before choosing the parameter θk, then θk is well-defined in Theorem 6. In fact, from the process of proof for Theorem 6, we can get the following assert: the convergence result of Theorem 6 always holds provided that we take θk ∈ [0, θ], θ ∈ [0,1),   for  all  k ≥ 0, with

()

To conclude, we have proposed an algorithm for solving the SCFP in the wide class of quasi-nonexpansive operators and proved its convergence in general Hilbert spaces. Next, we will improve the algorithm to assure the strong convergence in infinite Hilbert spaces.

Acknowledgments

This work was supported by the National Science Foundation of China (under Grant no. 11171221), Shanghai Municipal Committee of Science and Technology (under Grant no. 10550500800), Shanghai Leading Academic Discipline (under Grant no. XTKX 2012), Basic and Frontier Research Program of the Science and Technology Department of Henan Province (under Grant nos. 112300410277 and 082300440150), and China Coal Industry Association Scientific and Technical Guidance to Project (under Grant no. MTKJ-2011-403).

      The full text of this article hosted at iucr.org is unavailable due to technical difficulties.