Abstract
In this paper, we introduce a modified Halpern inertial method for approximating solutions of split feasibility problem and fixed point problem of Bregman strongly nonexpansive mappings in the framework of p-uniformly convex and uniformly smooth real Banach spaces. We establish a strong convergence result for the sequence generated by our iterative scheme under some mild conditions without the computation of the operator norm. We state some consequences and present some examples to show the efficiency and implementation of our proposed method. The result discussed in this paper extends and generalizes many recent results in this direction. Our result extends and complements some related results in literature.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Let \(X_1\) and \(X_2\) be p-uniformly convex and uniformly smooth real Banach spaces, C and Q are nonempty, closed and convex subsets of \(X_1\) and \(X_2\) respectively. The Split Feasibility Problem (SFP) is to find
where \(F: X_1 \rightarrow X_2\) is a bounded linear operator. We denote by \(\Omega := C \cap F^{-1}(Q)\) the solution set of SFP, then we have that \(\Omega \) is a closed and convex.
One of the most attractive problem in optimization is the SFP due to its numerous applications to real life problems such as signal processing, image reconstruction and medical care, (see [9, 10, 20]). Many interesting optimization problems such as equilibrium, variational inequality, variational inclusion and convex minimization problems have been defined in terms of SFP, (see [1, 5, 14, 20,21,22]). Many well known iterative algorithms have been proposed to solve the SFP (see [3, 4, 6, 17, 20]). In 1994, Censor and Elving [10] used the idea of multi-distance to obtain iterative methods for solving SFP. Their iterative methods, as well as others later, involve matrix inverses at each iteration. Bryne [8] introduced a projection method known as the CQ algorithm for approximating the SFP that does not involve matrix inverses, but assumed that the metric projections onto C and Q are easily calculated. However in most cases, it is impossible or needs too much work to compute the metric projections. Therefore if such appears, the efficiency of the projection-type methods including the CQ algorithm will be affected. In 2004, Yang [31] introduced a relaxed CQ for solving the SFP, where he employed two half spaces \(C_k\) and \(Q_k\) to replace C and Q respectively, at the kth iteration and the metric projections onto \(C_k\) and \(Q_k\) are easily computed. Recently Lopez et al. [15] introduced a self-adaptive step size to improve the CQ and the relaxed CQ iterative methods. It was noted that all these aforementioned iterative methods only use the current point to get the next iteration, which does not use the previous iteration \(x^{k-1}, x^{k-2}, \ldots ,\) and affect the flexibility. It is known that using some information of previous iterates will increase the flexibility of the algorithm. The study of SFP has been extended to the framework of 2-uniformly convex and uniformly smooth real Banach spaces. For instance, Ma et al. [17] proposed a shrinking iterative method for SFP and fixed point problem of quasi-\(\phi \)-nonexpansive mappings in Banach spaces. They proved a strong convergence result without imposing any compactness conditions and display a numerical example to show the behavior of their result.
In 2007, Schopfer [25] introduced the following algorithm: \(x_1 \in X_1\) and
where \(\Pi _C\) denotes the Bregman projection and J is the duality mapping. It is clear that (1.2) contains the CQ algorithm as a special case. In addition, Schopfer [25] obtained a weak convergence result for solving SFP provided the duality mapping J is weak-to-weak continuous and \(\gamma _n \in \bigg (0, \big (\frac{q}{C_q\Vert F\Vert ^{q}}\big )^{\frac{1}{q-1}}\bigg )\), where \(\frac{1}{p}+ \frac{1}{q}=1\) and \(C_q\) is the uniform smoothness coefficient of X. Readers should consult [3, 4, 6, 10, 20, 22, 24, 31] for more results on SFP and its generalization.
In optimization theory, one of the best ways to fasten up the rate of convergence of iterative method is to combine the iterative method with an inertial term. This term which is represented in its originality as \(\theta _n(x_n-x_{n-1})\) is a remarkable tool for improving the performance of iterative methods and it is known to have some nice convergence properties. Polyak [23] was the first to proposed the inertial extrapolation method for solving convex minimization problem. The inertial method is a two-step iterative method, using the first two iterations to define the next iteration. Nestrov [19] proposed a modified method to improve the convergence rate as follows:
where \(\theta _n \in [0,1)\) is an extrapolation factor, and \(\{\lambda _n\}\) is a positive sequence. Inspired by the inertial extrapolation method, many authors have proposed different inertial iterative methods to solve a number of optimization problems, see [1, 2, 4, 23, 24, 28]. It is worth mentioning that most results involving inertial extrapolation method in Banach spaces requires the modification or relaxation of the inertial term (most especially when Halpern method is employed, see (1.4) below) due to the geometry of the space and convexity problem. To retain its originality (i.e. \(\theta _n(x_n-x_{n-1}))\) in the aforementioned space, the shrinking or Hybrid iterative methods need to be employed. For instance, Godwin et al. [14] introduced the following inertial Halpern method for solving common solution of split minimization and fixed point problems with finite family of Bregman relatively nonexpansive mappings in the framework of p-uniformly convex and uniformly smooth Banach spaces. Given iterates \(x_{n-1}, x_n,\) compute \(\{x_n\}\) as follows:
where
\(\forall ~n \in \Omega ,\) where the index set \(\Omega :=\{n \in {\mathbb {N}}: T_i(w_n)-(prox_{\lambda _n^{i}}^{f_i}T_i(w_n)\ne 0)\}\), otherwise, \(\tau _{i,n}=\tau _i\) is any nonnegative real number for each \(i=0,1, \ldots , N.\) (Readers should consult [14] for definition of terms used in (1.4)). Also see [1, 2, 22] for results on modified inertial methods in Banach spaces.
Very recently, Shehu et al. [24] introduced the following self adaptive projection method with an inertial technique for split feasibility problems in Banach spaces: set \(x_0, x_1 \in C,\) define a sequence \(\{x_n\}\) by the following manner:
for all \(n \ge 0\) where \(f(w_n):=\frac{1}{p}\Vert (I-P_Q)Aw_n\Vert ^{p}\), \(\{\rho _n\} \subset (0, \infty ),\) and \(\liminf \limits _{n \rightarrow \infty }\rho _n(p-C_q\frac{\rho _n^{q-1}}{q})> 0.\) In (1.5), \(X_i, i=1,2\) is a p-uniformly convex real Banach space which is also uniformly smooth, C and Q are nonempty, closed and convex subsets of \(X_1\) and \(X_2.\)
It cab be seen from (1.4) where the Halpern method is employed that the inertial term is being modified. Also, in (1.5), the inertial term retain its originality as defined by Polyak [23] due to the nature of the algorithm.
Question Can we approximate solution of SFP and fixed point problem in p-uniformly Banach spaces which are also uniformly smooth with an inertial-Halpern method without modifying the inertial term, (see [2])?
In this article, we give an affirmative answer to the above question. We also state our contributions in this article as follows:
Remark 1.1
-
(i)
We consider SFP in p-uniformly convex and uniformly smooth Banach space which generalizes the results of [17].
-
(ii)
The step size \(\rho _n\) employed in our main result is generated at each iteration by some computation. Thus our algorithm is easily implemented without prior knowledge of operator norm.
-
(iii)
The inertial term employed in our main result retain its originality as defined by Polyak [23]. It is worth-mentioning that the results on inertial Halpern method in Banach spaces requires the modification or relaxation of the inertial term (see [2, 14, 22]) due to the geometry of the spaces (convexity to be precise). Thus, in our result, we proved a strong convergence result without modifying the inertial term.
-
(iv)
Our algorithm does not require at each step of the iteration process, the computation of subsets of \(C_n,~ Q_n\) and \(D_n\) (or \(C_{n+1})\) as in the case in [24] and the computation of the projection of the initial point onto their intersection, which leads to a high computational cost of iteration processes. The removal of all these restrictions makes our work applicable to more real world problems.
-
(v)
The inertial technique employed in our article is easily implemented since the value of \(\Vert J_{E}^{p}(x_n)-J_{E}^{p}(x_{n-1})\Vert \) is a prior known before choosing \(\theta _n\).
Motivated by the works of [20, 22, 24] and other related results in literature, we proposed a modified Halpern inertial method for approximating solution of split feasibility problem of Bregman strongly nonexpansive mappings in p-uniformly Banach spaces which are also uniformly smooth. We establish a strong convergence result for solving the solution of the aforementioned problems. It is worth-mentioning that the iterative algorithm employed in this article is designed in such a way that it does not require the computation of operator norm. The result discussed in this article extends and complements many related results in the literature.
2 Preliminaries
We state some known and useful results which will be needed in the proof of our main theorem. In the sequel, we denote strong and weak convergence by "\(\rightarrow \)" and "\(\rightharpoonup \)", respectively.
Let X be a re al Banach space with norm \(\Vert .\Vert \) and \(X^*\) be the dual space of E. Let \(K(X):=\{x \in X:\Vert x\Vert =1\}\) denote the unit sphere of X. The modulus of convexity is the function \(\delta _X:(0,2]\rightarrow [0,1]\) defined by
The space X is said to be uniformly convex, if \(\delta _X(\epsilon )> 0\) for all \(\epsilon \in (0,2]\). Let \(p > 1\), then X is said to be p-uniformly convex (or to have a modulus of convexity of power type p) if there exists \(c_p > 0\) such that \(\delta _X(\epsilon ) \ge c_p\epsilon ^{p}\) for all \(\epsilon \in (0,2]\). Note that every p-uniformly convex space is uniformly convex. The modulus of smoothness of X is the function \(\rho _X: {\mathbb {R}}^{+}:=[0, \infty )\rightarrow {\mathbb {R}}^{+}\) defined by
The space X is said to be uniformly smooth, if \(\frac{\rho _X(\tau )}{\tau }\rightarrow 0\) as \(\tau \rightarrow 0\). Let \(q > 1\), then a Banach space X is said to be q-uniformly smooth if there exists \(\kappa _q >0\) such that \(\rho _X(\tau ) \le \kappa _q \tau ^{q}\) for all \(\tau > 0\). Moreover, a Banach space X is p-uniformly convex if and only if \(X^*\) is q-uniformly smooth, where p and q satisfy \(\frac{1}{p}+ \frac{1}{q}= 1\), (see [12]).
Let \(p > 1\) be a real number, the generalized duality mapping \(J_{X}^{p}:X \rightarrow 2^{X^*}\) is defined by
where \(\langle \cdot ,\cdot \rangle \) denotes the duality pairing between elements of X and \(X^*\). In particular, \(J_{X}^p=J_{X}^2\) is called the normalized duality mapping.
If X is p-uniformly convex and uniformly smooth, then \(X^*\) is q-uniformly smooth and uniformly convex. In this case, the generalized duality mapping \(J_{X}^{p}\) is one-to-one, single-valued and satisfies \(J_{X}^p=(J_{X^*}^{q})^{-1}\), where \(J_{X^*}^{q}\) is the generalized duality mapping of \(X^*\). Furthermore, if X is uniformly smooth then the duality mapping \(J_{X}^{p}\) is norm-to-norm uniformly continuous on bounded subsets of X, (see [13] for more details).
Let \(f: X \rightarrow (-\infty , + \infty ]\) be a proper, lower semicontinuous and convex function, then the Frenchel conjugate of f denoted as \(f^*: X^* \rightarrow (-\infty ,+ \infty ]\) is define as
Let the domain of f be denoted as \((dom f)=\{x \in X: f(x)< +\infty \}\), hence for any \(x \in int(dom f)\) and \(y \in X\), we define the right-hand derivative of f at x in the direction y by
Definition 1.2
[7] Let \(f:X \rightarrow (-\infty ,+ \infty ]\) be a convex and G\({\hat{a}}\)teaux differentiable function. The function \(\Delta _f: X \times X \rightarrow [0, + \infty )\) defined by
is called the Bregman distance with respect of f.
It is well-known that Bregman distance \(\Delta _f\) does not satisfy the properties of a metric because \(\Delta _f\) fail to satisfy the symmetric and triangular inequality property. Moreover, it is well known that the duality mapping \(J_{X}^{p}\) is the sub-differential of the functional \(f_p(.)= \frac{1}{p}\Vert .\Vert ^{p}\) for \(p > 1\), see [11]. Then, the Bregman distance \(\Delta _p\) is defined with respect to \(f_p\) as follows:
The Bregman distance is not symmetric therefore is not a symmetric but it possess the following important properties:
and
Let Fix(T) denotes the set of fixed points of a mapping T from C into itself. That is \(Fix(T)=\{x \in C: Tx=x\}\). A point \(p \in C\) is said to be an asymptotic fixed point of T, if C contains a sequence \(\{x_n\}_{n=1}^{\infty }\) which converges weakly to p and \(\lim \limits _{n\rightarrow \infty }\Vert x_n-Tx_n\Vert =0\). We denote by \({\hat{F}}ix(T),\) the set of asymptotic fixed points of T. Moreso, a mapping \(T:C \rightarrow int(dom f)\) is said to be
-
(i)
Bregman relatively nonexpansive, if
$$\begin{aligned} {{\hat{F}}ix(T)}=Fix(T)~\text {and}~\Delta _p(p, Tx) \le \Delta _p(p,x),~\forall ~x \in C,~p \in Fix(T). \end{aligned}$$ -
(ii)
Bregman quasi-nonexpansive, if
$$\begin{aligned} Fix(T) \ne \emptyset ~ \text {and}~ \Delta _p(p, Tx) \le \Delta _p(p, x),~\forall ~x \in C,~p \in Fix(T). \end{aligned}$$ -
(iii)
Bregman firmly nonexpansive mapping (BFNE) if
$$\begin{aligned} \langle J_{p}^{X}(Tx)-J_{p}^{X}(Ty), Tx-Ty\rangle \le \langle J_{p}^{X}(x)-J_{p}^{X}(y), Tx-Ty\rangle ,~\forall ~x, y \in C, \end{aligned}$$ -
(iv)
Bregman strongly nonexpansive mapping (BSNE) [27] with \({{\hat{F}}ix(T)}\ne \emptyset \) if
$$\begin{aligned} \Delta _{p}(y, Tx) \le \Delta _p(y,x),~\forall ~y \in {\hat{F}}ix(T) \end{aligned}$$and for any bounded sequence \(\{x_n\}_{n \ge 1} \subset C\),
$$\begin{aligned} \lim _{n \rightarrow \infty }(\Delta _p(y, x_n)-\Delta _p(y, Tx_n))=0 \end{aligned}$$implies
$$\begin{aligned} \lim _{n \rightarrow \infty }\Delta _p(Tx_n, x_n)=0. \end{aligned}$$
Recall that a metric projection \(P_C\) from X onto C satisfies the following property:
It is well known that \(P_Cx\) is the unique minimizer of the norm distance. Moreover, \(P_Cx\) is characterized by the following properties:
The Bregman projection from X onto C denoted by \(\Pi _{C}\) also satisfies the property
Also, if C is a nonempty, closed and convex subset of a p-uniformly convex and uniformly smooth Banach space X and \(x \in X\). Then the following assertions holds:
-
(i)
\(z=\Pi _{C}x\) if and only if
$$\begin{aligned} \langle J_{X}^{p}(x)-J_{X}^{p}(z),~ y-z\rangle \le 0,~\forall ~y \in C; \end{aligned}$$(2.6) -
(ii)
$$\begin{aligned} \Delta _p(\Pi _{C}x, y)+ \Delta _p(x, \Pi _Cx)\le \Delta _p(x,y),~\forall ~y \in C. \end{aligned}$$(2.7)
When considering the p-uniformly convex space, the Bregman distance and the metric distance have the following relation, (see [24]).
where \(\pi _p > 0\) is some fixed number. If \(\frac{1}{p}+\frac{1}{q}=1\), by Young’s inequality, we have
Lemma 1.3
[11] Let X be a Banach space and \(x, y \in X\). If X is q-uniformly smooth, then there exists \(C_q > 0\) such that
Lemma 1.4
[26] Let X be a real p-uniformly convex and uniformly smooth Banach space. Let \(V_p: X^* \times X \rightarrow [0, +\infty )\) be defined by
Then the following assertions hold:
-
(i)
\(V_p\) is nonnegative and convex in the first variable.
-
(ii)
\(\Delta _p(J_{q}^{X^*}(x^*), x)= V_p(x^*, x),~ \forall ~x \in X, ~x^* \in X\).
-
(iii)
\(V_p(x^*, x) + \langle y^*,J_{q}^{X^*}(x^*)-x\rangle \le V_p(x^*+y^*,x), \forall ~x \in X,~x^*, y^* \in X\).
Lemma 1.5
[12] Let X be a real p-uniformly convex and uniformly smooth Banach space. Suppose that \(\{x_n\}\) and \(\{y_n\}\) are bounded sequences in X. Then \(\lim \limits _{n\rightarrow \infty } \Delta _p(x_n, y_n)=0\) implies \(\lim \limits _{n\rightarrow \infty }\Vert x_n-y_n\Vert =0\).
Lemma 1.6
[30] Assume \( \{a_n\} \) is a sequence of nonnegative real sequence such that
where \( \{\sigma _n\} \) is a sequence in (0, 1) and \( \{\delta _n\}\) is a real sequence such that
-
(i)
\( \sum \limits _{n=1}^{\infty } \sigma _n = \infty , \)
-
(ii)
\( \limsup \limits _{n\rightarrow \infty }\delta _n \le 0 \) or \( \sum \limits _{n=1}^{\infty }|\sigma _n \delta _n| < \infty . \) Then \( \lim \limits _{n\rightarrow \infty } a_n = 0. \)
Lemma 1.7
[18] Let \(\Gamma _n\) be a sequence of real numbers that does not decrease at infinity, in the sense that there exists a subsequence \(\{\Gamma _{n_j}\}_j\ge 0\) of \(\{\Gamma _{n_j}\}\) which satisfies \(\Gamma _{n_j}\le \Gamma _{n_j+1}\) for all \(j\ge 0\). Also consider a sequence of integers \(\{\tau (n)\}_n\ge n_0\) defined by
Then \(\{\tau (n)\}_n\ge n_0\) is a nondecreasing sequence satisfying \(\lim \limits _{n\infty }\tau (n)=\infty \).
If it holds that \(\Gamma _\tau (n)\le \Gamma _{\tau (n)+1}\)
3 Main result
Theorem 1.8
Let \(X_1\) and \(X_2\) be p-uniformly convex and uniformly smooth real Banach spaces and \(F:X_1 \rightarrow X_2\) be a bounded linear operator with its adjoint \(F^*: X_2^{*} \rightarrow X_1^{*}\). Let C and Q be nonempty, closed and convex subsets of \(X_1\) and \(X_2\) respectively, and \(f:X_2 \rightarrow {\mathbb {R}}\) be a non-negative lower semi-continous convex function. Suppose \(S: X_1 \rightarrow X_1\) is a Bregman strongly nonexpansive mapping with \(\Gamma :=\Omega \cap Fix(S)\) is nonempty. Let \(\{\lambda _n\}\) be a positive sequence in \((0, \dfrac{p\pi _p}{2^{p-1}})\), where \(\pi _p\) is defined in (2.8), \(\lambda _n=\circ (\alpha _n), \{\alpha _{n}\}, \{\beta _n\}\), \(\{\gamma _n\}\) are sequences in (0, 1) and \(\alpha _{n}+\beta _n+ \gamma _n=1\) such that \(\lim \limits _{n\rightarrow \infty }\alpha _n=0\) and \(\sum \limits _{n=1}^{\infty }\alpha _{n}=\infty , \beta _n \in (a,b) \subset (0,1)\) and \(\gamma _n\in (c,d) \subset (0,1)\) for all \(n \ge 1\). For fixed \({v}, x_0, x_1 \in X_1,\) choose \(\theta _n\) such that \(0\le \theta _n \le {\bar{\theta }}_n,\) then define a sequence \(\{x_n\}\) by the following manner:
where
\(f(u_n):=\frac{1}{p}\Vert (I-P_Q)Fu_n\Vert ^{p}, {\nabla f(u_n):=F^*J_{X_2}^{p}(I-P_Q)Fu_n},~ \{\rho _n\}\subset (0, \infty )\) and \(\liminf \limits _{n \rightarrow \infty }\rho _n(p-C_q\frac{\rho _{n}^{q-1}}{q})>0, \) where \(C_q\) is the uniform smoothness coefficient of \(X_1\). Then \(\{x_n\}\) converges strongly to \(x^*=\Pi _{\Gamma }v\).
Proof
Let \(z \in \Gamma \) and \(b_n=J_{X_{1}^{*}}^{q}[J_{X_1}^{p}(u_n)-\rho _n \frac{f^{p-1}(u_n)}{\Vert \nabla f(u_n)\Vert ^{p}}\ f(u_n)]\) for all \(n \ge 1\). We obtain from Lemma 2.2 that
By applying (2.7) and (3.3), we get
But from (2.4) and that \(Fz \in Q\)
On substituting (3.5) into (3.4), it yields
Hence, we conclude that
Now, using (2.8), (2.9) and (3.1), we have
Also using (2.3), we get
On substituting (3.8) into (3.9), we have
From (3.1), (3.8) and (3.10), we obtain
From the assumption that \(\lim \limits _{n \rightarrow \infty } \frac{\lambda _n}{\alpha _n}=0\), taking \(\phi \in (0, \frac{p \pi _p}{2^{p-1}})\). Then there exists \(N \in {\mathbb {N}}\) such that \(\lambda _n < \alpha _n\) for all \(n \ge {\mathbb {N}}\).
Hence
For some constant \(M > 0,\) it follows from (3.10) that
By substituting (3.12) into (3.11), we get
This implies that \(\{\Delta _p(x_n,z)\}\) is bounded. Consequently, \(\{\Delta _p(u_n,z)\}\) and \(\{\Delta _p(y_n,z)\}\) are bounded. By applying Lemma 2.4, we obtain that \(\{x_n\},~ \{u_n\}\) and \(\{y_n\}\) are bounded.
From (3.1), (3.6) and (3.12), we obtain
Case 1: Suppose that there exists \(n_0 \in {\mathbb {N}}\) such that \(\{\Delta _p(x_n,z)\}\) is non-increasing for all \(n \ge n_0\). Then \(\{\Delta _p(x_n,z)\}\) converges and
From (3.13), we get
Hence,
Since \(\liminf \limits _{n \rightarrow \infty }\rho _n(p-\frac{C_q\rho _n^{q-1}}{q})> 0,\) we obtain that
and hence
Since \(\{\nabla f(u_n)\}\) is bounded, we obtain from (3.18) that
Hence,
and thus
By applying Lemma 2.4 in (3.16), we obtain
From the definition of \(b_n\), we obtain that
Since \(J_{X_{1}^{*}}^{q}\) is norm-to-norm uniformly continuous subsets on \(X_{1}^{*},\) then
and in view of (2.8), we get
By applying (3.20), we have
Let \(h_n=J_{X_{1}^{*}}^{p}\big [\frac{\beta _n}{1-\alpha _{n}}J_{X_1}^{p}(y_n) + \frac{\gamma _n}{1-\alpha _{n}}J_{X_1}^{p}(Sy_n)\big ]\), then
Hence from (3.12), we have
Also
Thus,
Hence, we conclude that
which implies from Lemma 2.4 that
Using (2.7), we get
In view of Lemma 2.4, we obtain that
Let \(k_n:=J_{X_{1}^{*}}^{q}\big [\alpha _{n}J_{X_1}^{p}(v) + \beta _n J_{X_1}^{p}(y_n) + \gamma _n J_{X_1}^{p}(Sy_n)\big ]\), then from (3.1), (3.29) and Lemma 2.4, we obtain
Hence,
By applying (2.7), (3.33) and Lemma 2.4, we get
and hence,
From (3.21)and (3.32), we obtain
By applying (3.34) and (3.37), we have
Consequently, using (3.36) and (3.37), we get
Since \(\{x_n\}\) is bounded, there exists a subsequence \(\{x_{n_j}\}\) of \(\{x_n\}\) which converges weakly to \(z \in C\). Using (3.21) and (3.37), there exist susbsequences \(\{u_{n_j}\}\) of \(\{u_n\}\) and \(\{y_{n_j}\}\) of \(\{y_n\}\) which converge weakly to z. Using (3.30), it follows that \(z \in Fix(S)\) as \(Fix(S)={{\hat{Fix}}(S)}\). Next, we show that \(Fz \in Q\). Now from (2.4), we obtain
By the continuity of F and (3.32), we obtain that \(Fu_{n_j}\rightharpoonup Fz\) as \(j \rightarrow \infty \). Hence, if we let \(j \rightarrow \infty \), we get
Therefore, \(Fz=P_{Q}Fz,\) which implies that \(Fz \in Q\). Hence, we conclude that \(z \in Fix(S) \cap \Omega =\Gamma .\) Since \(x^*=\Pi _{\Gamma }v,\) then applying Lemma 2.3 (ii), (iii) and (3.12), we have
Next, since \(x_{n_j}\rightharpoonup x^*\in \Gamma \), then for any \(x^*=\Pi _{\Gamma }u\) we get from (2.6) that
Hence, from (3.38), we get
Therefore, on substituting (3.41) into (3.40) and applying Lemma 2.5, we obtain that \(\Delta _p(x_n,x^*) \rightarrow 0\) as \(n \rightarrow \infty \). By (2.7), we know that \(\tau _p\Vert x_n-x^*\Vert \le \Delta _p(x_n,x^*) \rightarrow 0.\) Hence \(\{x_n\}\) converges strongly to \(x^*=\Pi _{\Gamma }v\).
Case 2: Suppose that there exists a subsequence \(\{\eta _j\}\) of \(\{\eta \}\) such that \(\Delta _p(x_{n_j},x^*) < \Delta _p(x_{n_{j+1}},x^*)\) for all \(j \in {\mathbb {N}}\). Then by Lemma 2.6, there exists a nondecreasing sequence \(\{m_k\} \subseteq {\mathbb {N}}\) such that \(m_{k} \rightarrow \infty ,\) and
Following the same process as in Case 1, we obtain that
Again from (3.40), we have
that is,
which implies that
Therefore, \(\Delta _p(x_{m_k},x^*)=0\) and since
we conclude that \(x_{k}\rightarrow x^*, k \rightarrow \infty .\) \(\square \)
Corollary 1.9
Let \(X_1\) and \(X_2\) be p-uniformly convex and uniformly smooth Banach spaces and \(F:X_1 \rightarrow X_2\) be a bounded linear operator with its adjoint \(F^*: X_2^{*} \rightarrow X_1^{*}\). Let C and Q be nonempty, closed and convex subsets of \(X_1\) and \(X_2\) respectively, and \(f:X_1 \rightarrow {\mathbb {R}}\) be a non-negative lower semi-continous convex function. Suppose \(\Omega \ne \emptyset \) and let \(\{\lambda _n\}\) be a positive sequence in \((0, \frac{p\pi _p}{2^{p-1}})\), where \(\pi _p\) is defined in (2.8), \(\lambda _n=\circ (\alpha _n), \{\alpha _{n}\}, \{\beta _n\}\), \(\{\gamma _n\}\) are sequences in (0, 1) and \(\alpha _{n}+\beta _n+ \gamma _n=1\) such that \(\lim \limits _{n\rightarrow \infty }\alpha _n=0\) and \(\sum \limits _{n=1}^{\infty }\alpha _{n}=\infty , \beta _n \in (a,b) \subset (0,1)\) and \(\gamma _n\in (c,d) \subset (0,1)\) for all \(n \ge 1\). For fixed \({v}, x_0, x_1 \in X_1,\) choose \(\theta _n\) such that \(0\le \theta _n \le \overline{\theta _n},\) then define a sequence \(\{x_n\}\) by the following manner:
where
\(f(u_n):=\frac{1}{p}\Vert (I-P_Q)Fu_n\Vert ^{p}, \{\rho _n\}\subset (0, \infty )\) and \(\liminf \limits _{n \rightarrow \infty }\rho _n(p-C_q\frac{\rho _{n}^{q-1}}{q})>0, \) where \(C_q\) is the uniform smoothness coefficient of \(X_1\). Then \(\{x_n\}\) converges strongly to \(x^*=\Pi _{\Omega }v\).
4 Numerical example
Example 4.1
Let \(X_1=X_2=L_2([0,1])\) with the inner product given as
\(\langle f,g\rangle =\int _{0}^{1}f(t)g(t)dt.\)
Let
\(C:=\{x \in L_2([0,1]): \langle x,a\rangle \ge b\},\)
where \(a=2t^2\) and \(b=0.\) Then
\(P_{C}x=x + \frac{b-\langle a,x\rangle }{\Vert a\Vert ^2}a\).
Also, let
\(Q:=\{x \in L_2([0,1]): \langle x,c\rangle = d\},\)
where \(c=\frac{t}{3},~d=-1.\) Then
\(\Pi _{Q}(x)=P_{Q}(x)=x + \max \big \{0, \frac{d-\langle c,x\rangle }{\Vert c\Vert ^2}c\big \}.\)
Let \(F:L_2([0,1]) \rightarrow L_([0,1])\) be defined by \(Fx(t)=\frac{x(t)}{2}\) with adjoint \(F^{*}x(t)=\frac{x(t)}{2}\). Then F is a bounded linear operator. We set \(Sx(t)=P_C(x(t))\). Hence by taking \(\alpha _n=\frac{1}{n+1},~\beta _n=\frac{n}{2n+5}, \gamma _n=1-\alpha _{n}-\beta _n,~\theta _{n}=2\) and \(\rho _n=10^{-7},~\forall ~n \ge 1.\) We choose the stopping criterion as in Example 4.1, we make a comparison of Algorithm 3.1 with one in which the direction of the momentum \(x_n-x_{n-1}\) is altered. The report of this experiment is reported in Fig. 2 for different initial values of \(x_0\) and \(x_1.\)
-
Case i
\(x_0=t\) and \(x_1=2t+1;\)
-
Case ii
\(x_0=\frac{5t^2}{2}-2t\) and \(x_1=\exp (2t);\)
-
Case iii
\(x_0=2t\) and \(x_1=\log (2t);\)
-
Case iv
\(x_0=t^{\frac{3}{4}}+3\) and \(x_1=t^2+2t+1.\)
Example 4.2
We give a numerical example in \(({\mathbb {R}}^{3}, \Vert .\Vert _2)\) of the problem considered in Theorem 3.1.
Let
\(C:=\{x=(x_1,x_2,x_3) \in {\mathbb {R}}^3: \langle a,x\rangle = b\},\)
where \(a=(3, 5, 7)\) and \(b=2,\) then
\(\Pi _{C}(x)=P_{C}(x)=\max \left\{ 0,\frac{ b- \langle a,x\rangle }{\Vert a\Vert ^{2}_{2}}\right\} a +x.\)
Also, let
\(Q:=\{x=(x_1, x_2, x_3)\in {\mathbb {R}}^3: \langle a,x\rangle \ge b\},\)
where \(a=(2,-1,5)\) and \(b=1,\) then
\(P_{Q}(x)=\frac{b-\langle a, x\rangle }{\Vert a\Vert _{2}^{2}}a +x.\)
In addition, let \(S=P_{C}\) and
Hence, by taking \(\alpha _n=\frac{1}{n+1},~\beta _n=\frac{n}{2n+5}, \gamma _n=1-\alpha _{n}-\beta _n\), \(\rho _{n}=0.1~\) and \(\theta _{n}=1~\forall ~n \ge 1.\) By choosing \(\Vert x_{n+1}-x_n\Vert =10^{-4}\) as the stopping criterion, we make a comparison of Algorithm 3.1 with one in which the direction of the momentum \(x_n-x_{n-1}\) is altered. The report of this experiment is reported in Fig. 2 for different initial values of \(x_0\) and \(x_1.\)
-
Case i
\(x_0=[3,0,0]'\) and \(x_1=[2,3,2]';\)
-
Case ii
\(x_0=[1,1,1]'\) and \(x_1=[2,1,2]';\)
-
Case iii
\(x_0=[2,2,2]'\) and \(x_1=[1,0,2]';\)
-
Case iv
\(x_0=[5,5,3]'\) and \(x_1=[4,4,4]'\)
Remark 4.3
Our proposed method has connections with some recent methods in literature. For instance, the inertial factor \(\theta _{n}\) in our iterative algorithm has similar property with the recent papers of Shehu et al. [24] where the inertial factor is bounded. In these articles, In this article, several choices of \(\{\theta _{n}\}\) are considered in numerical implementations and the authors showed that their proposed methods are efficient and implementable.
5 Conclusion
It is well known that the inertial extrapolation method plays a crucial role in the convergence rate of iterative methods in optimization problems. In our article, we proposed an inertial extrapolation method (without modification) together with an Halpern method to approximate solution of split feasibility problem and fixed point problem of Bregman strongly nonexpansive mappings in p-uniformly convex and uniformly smooth real Banach spaces. Some numerical examples were presented to illustrate the performance of our method.
In our future research, we would like to extend this concept to nonlinear spaces due to its numerous applications to real-life problems.
References
Abass, H.A., Ugwunnadi, G.C., Narain, O.K.: A modified inertial Halpern method for solving split monotone variational inclusion problems in Banach spaces. Rendiconti del Circolo Mat di Palermo series 2, 1–24 (2022)
Ali, B., Ugwunnadi, G.C., Lawan, M.S., Khan, A.R.: Modified inertial subgradient extragradient method in reflexive Banach spaces. Bol. Soc. Mat. Mex. 27, 30 (2021)
Abass, H.A., Oyewole, O.K., Mebawondu, A.A., Aremu, K.O., Narain, O.K.: On split feasibility problem for finite families of equilibrium and fixed point problems in Bnach spaces. Demonstratio Math. 55, 658–675 (2022)
Abass, H.A., Jolaoso, L.O.: An inertial generalized viscosity approximation method for solving multiple-sets split feasibility problem and common fixed point of strictly pseudo-nonspreading mappings. Axioms 10, 1 (2021)
Abass, H.A., Oyewole, O.K., Narain, O.K., Jolaoso, L.O., Olajuwon, B.I.: On split generalized equilibrium and fixed point problems with multiple output sets in real Banach spaces. Comput. Appl. Math. 41, 416 (2022)
Ali Homidan, S., Ali, B., Suleiman, Y.I.: Generalized split feasibility problemm for multi-valued Bregman quasi-nonexpansive mappings in Banach spaces. Appl. Numer. Math. 161, 437–451 (2021)
Bregman, L.M.: The relaxation method for finding the common point of convex sets and its application to solution of problems in convex programming. U.S.S.R Comput. Math. Phys. 7, 200–217 (1967)
Bryne, C.: Iterative oblique projection onto convex subsets and the split feasibility problems. Inverse Probl. 18, 441–453 (2002)
Bryne, C.: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 20(1), 103–120 (2004)
Censor, Y., Elfving, T.: A multiprojection algorithms using Bregman projections in a product space. Numer. Algor. 8, 221–239 (1994)
Chidume, C.E.: Geometric properties of Banach spaces and nonlinear iterations. Springer, Berlin (2009)
Cholamjiak, P., Sunthrayuth, P.: A halpern-type iteration for solving the split feasibility problem and fixed point problem of Bregman relatively nonexpansive semigroup in Banach spaces. Filomat 32(9), 3211–3227 (2018)
Cioranescu, I.: Geometry of Banach Spaces, Duality Mappings and Nonlineqar Problems. Kluwer Academic, Dordrecht (1990)
Godwin, E.C., Alakoya, T.O., Mewomo, O.T., Yao, J.C.: Approximation of solutions of the split minimization problem with multiple output sets and common fixed point problems in real Banach spaces. J. Nonlinear Var. Anal. 6(4), 333–358 (2022)
Lopez, G., Martin-Marquez, V., Wang, F., Xu, H.K.: Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Probl. 20(4), 1261–1266 (2004)
Ma, Z., Wang, L., Cho, Y.J.: Some results for split equality equilibrium problems in Banach spaces. Symmetry (2019). https://doi.org/10.3390/sym11020194
Ma, Z., Wang, L., Chang, S.S.: On the split feasibility problem and fixed point problem of quasi-\(\phi \)-nonexpansive mapping in Banach spaces. Numer. Algor. 80, 1203–1218 (2019)
Mainge, P.E.: Viscosity approximation process for quasi nonexpansive mappings in Hilbert space. Comput. Math. Appl. 59, 74–79 (2010)
Nestrov, Y.: A method for solving the convex programming problem with convergence rate \(\circ (\frac{1}{k^2})\). Dokl. Akad. Nauk SSSR 269, 543–547 (1983)
Okeke, C.C., Izuchukwu, C.: Strong convergence theorem for split feasibility problems and variational inclusion problems in real Banach spaces. Rendiconti de Circolo Matematico di Palermo series (2021). https://doi.org/10.1007/s12215-020-00508-3
Oyewole, O.K., Abass, H.A., Mewomo, O.T.: A strong convergence algorithm for a fixed point constraint split null point problem. Rendiconti de Circolo Matematico di Palermo series 2, 1–20 (2020)
Pholasa, N., Kankan, K., Cholamjiak, P.: Solving the split feasibility problem and the fixed point problem of left Begman firmly nonexpansive mappings via the Dynamical step sizes in Banach spaces. Vietnam J. Math. 49(4), 1011–1026 (2021)
Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Phys. 4, 1–17 (1964)
Shehu, Y., Vuong, P.T., Cholamjiak, P.: A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems. J. fixed point theory appl. 21, 50 (2019)
Schopfer, F.: Iterative regularisation method for the solution of the split feasibility problem in Banach spaces. Ph.D thesis, Saabrucken (2007)
Shehu, Y., Ogbuisi, F.U., Iyiola, O.S.: Convergence analysis of an iterative algorithm for fixed point problems and split feasibility problems in certain Banach spaces. Optimization 65, 299–323 (2016)
Suantai, S., Cho, Yj., Cholamjiak, P.: Halperns iteration for Bregman strongly nonexpansive mappings in reflexive Banach spaces. Comput. Math. Appl. 64, 489–499 (2012)
Taiwo, A., Jolaoso, L.O., Mewomo, O.T.: Inertial type algorithm for solving split common fixed point problems in Banach spaces. J. Sci. Comput. 86, 12 (2021)
Takahashi, W.: Nonlinear Functional. Kindikagaku, Tokyo (1988)
Xu, H.K.: Iterative algorithms for nonlinear operators. J. London Math. Soc. 66(1), 240–256 (2002)
Yang, Q.: The relaxed CQ algorithm for solving split feasibility problem. Inverse Probl. 20(4), 1261–1266 (2004)
Zarantonello, E. H.: Solving functional equations by contractive averaging, Tech. Report, Math. Res. Center U. S. Army, Madison University of Wisconsin, 160, June (1960)
Funding
Open access funding provided by Sefako Makgatho Health Sciences University.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Ugwunnadi, G.C., Abass, H.A., Aphane, M. et al. Inertial Halpern-type method for solving split feasibility and fixed point problems via dynamical stepsize in real Banach spaces. Ann Univ Ferrara 70, 307–330 (2024). https://doi.org/10.1007/s11565-023-00473-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11565-023-00473-6
Keywords
- Split feasibility problem
- Bregman strongly nonexpansive
- Iterative scheme
- Inertial method
- Fixed point problem