Abstract
In this paper, we present a new self-adaptive inertial projection method for solving split common null point problems in p-uniformly convex and uniformly smooth Banach spaces. The algorithm is designed such that its convergence does not require prior estimate of the norm of the bounded operator and a strong convergence result is proved for the sequence generated by our algorithm under mild conditions. Moreover, we give some applications of our result to split convex minimization and split equilibrium problems in real Banach spaces. This result improves and extends several other results in this direction in the literature.
1. Introduction
Let and be real Hilbert spaces and C and Q be nonempty, closed and convex subsets of and , respectively. We consider the Split Common Null Point Problem (SCNPP) which was introduced by Byrne et al. [1] as follows:
where and are maximal monotone operators and is a linear bounded operator. The solution set of SCNPP (1) is denoted by The SCNPP contains several important optimization problems such as split feasibility problem, split equilibrium problem, split variational inequalities, split convex minimization problem, split common fixed point problems, etc., as special cases (see, e.g., [1,2,3,4,5]). Due to their importance, several researchers have studied and proposed various iterative methods for finding its solutions (see, e.g., [1,4,5,6,7,8,9]). In particular, Byrne et al. [1] introduced the following iterative scheme for solving SCNPP in real Hilbert spaces:
where for all They also proved that the sequence generated by (2) converges weakly to a solution of SCNPP provided the step size satisfies
where L is the spectral radius of Furthermore, Kazmi and Rizvi [10] proposed a viscosity method which converges strongly to a solution of (1) as follows:
where satisfies some certain conditions and is a nonexpansive mapping. It is important to emphasize that the convergence of (4) is achieved with the aid of condition (3). Other similar results can be found, for instance, in [11,12] (and references therein). However, it is well known that the norm of bounded linear operator is very difficult to find (or at least estimate) (see [13,14,15]). Hence, it becomes necessary to find iterative methods whose step size selection does not require prior estimate of the norm of the bounded linear operator. Recently, some authors have provided breakthrough results in the framework of real Hilbert spaces (see, e.g., [13,14,15]).
On the other hand, Takahashi [8,16] extends the study of SCNPP (1) to uniformly convex and smooth Banach spaces as follows: Let and be uniformly convex and uniformly smooth real Banach spaces with dual and , respectively, and be a bounded linear operator. Let and be maximal monotone operators such that , and is a metric resolvent operator with respect to B and parameter Takahashi and Takahashi [17] introduced the following shrinking projection method for solving SCNPP in uniformly convex and smooth Banach spaces:
where are the normalized duality mapping with respect to for (defined in the next section). They proved a strong convergence result with the condition that the step size satisfies
Furthermore, Suantai et al. [18] introduced a new iterative scheme for solving SCNPP in a real Hilbert space H and a real Banach space E as follows:
where such that and is a contraction mapping. They also proved a strong convergence result under the condition that the step size satisfies
Recently, Takahashi [19] introduced a new hybrid method with generalized resolvent operators for solving the SCNPP in real Banach spaces as follows:
He also proved that the sequence generated by Algorithm (7) converges strongly to a solution of SCNPP provided the step sizes satisfy
It is evident that the above methods and other similar ones (see, e.g., [6,9,20]) require prior knowledge of the operator norm, which is very difficult to find. Thus, the following natural question arises.
Problem 1.
Can we provide a new iterative method for solving SCNPP in real Banach spaces such that the step size does not require prior estimate of the norm of the bounded linear operator?
Let us also mention the inertial extrapolation process which is considered as a means of speeding up the rate of convergence of iterative methods. This technique was first introduced by Polyak [21] as a heavy-ball method of a two-order time dynamical system and has been employed by many authors recently (see, e.g., [22,23,24,25,26,27]). Moreover, Dong et al. [27] introduced a modified inertial hybrid algorithm for approximating the fixed points of non-expansive mappings in real Hilbert spaces as follows:
where , are suitable parameters.
More recently, Cholamjiak et al. [28] introduced an inertial forward-backward algorithm for finding the zeros of sum of two monotone operators in Hilbert spaces as follows:
where for some and are sequences in The authors proved that the sequence generated by (9) converges strongly to a solution under some mild conditions.
Motivated by the above results, in this paper, we aim to provide an affirmative answer to Problem 1. We introduce a new inertial shrinking projection method for solving SCNPP in p-uniformly convex and uniformly smooth real Banach spaces. The algorithm is designed such that its step size is determined by a self-adaptive technique and its convergence does not require prior knowledge of the norm of the bounded operator. We also prove a strong convergence result and provide some applications of our main theorem to solving other nonlinear optimization problems. This result improves and extends the results in [6,8,9,11,12,16,19,20] and many other recent results in the literature.
2. Preliminaries
Let E be a real Banach space with dual and norm We denote the duality pairing between and as The weak and strong convergence of to are denoted by and , respectively, ∀ by “for all” and ⇔ by “if and only if”. The function defined by
is called the modulus of convexity of E. The Banach space E is said to be uniformly convex if If there exists a constant such that for any then we say E is p-uniformly convex. In addition, the function defined by
is called the modulus of smoothness of E. The Banach space E is said to be uniformly smooth if If there exists a constant such that for any then E is called q-uniformly smooth Banach space. Let with We Remark that a Banach space E is p-uniformly convex if and only if its dual is q-uniformly smooth. Examples of q-uniformly smooth Banach spaces include Hilbert spaces, (or spaces, and the Sobolev spaces, (see [29]). Moreover, the Hilbert spaces are uniformly smooth while
Let be a continuous strictly increasing function. is called a gauge function if
The duality mapping with respect to , i.e., is defined by
When then we call a normalized duality mapping. In addition, if where then, is called a generalized duality mapping defined by
In the sequel, C is a nonempty closed convex subset of E and is the set of fixed point of
Definition 1.
Ref. [30] Let E be a Banach space, a duality mapping with gauge function and C a nonempty subset of A mapping is said to be
- (i)
- φ-firmly non-expansive iffor all
- (ii)
- φ-firmly quasi-non-expansive if andfor all u in C and z in
Definition 2.
Given a Gâteaux differentiable and convex function the function
is called the Bregman distance of u to v with respect to the function
Moreover, since is the derivative of the function , in that case, the Bregman distance with respect to becomes
Remark 1.
It follows from the Definition of that
and
Although the Bregman is not symmetrical, it however has the following relationship with distance:
This indicates that Bregman distance is non-negative.
Definition 3.
The Bregman projection mapping is defined by
The Bregman projection can also be characterized by the following inequality
This is equivalent to
Lemma 1.
Ref. [31] Let E be a q-uniformly smooth Banach space with q-uniformly smoothness constant For any the following inequality holds:
Definition 4.
A mapping is said to be closed or has a closed graph if a sequence converges strongly to a point and then
Lemma 2.
Ref. [29] It is known that the generalized duality has the following properties:
- (I)
- is nonempty bounded closed and convex, for any
- (II)
- If E is a reflexive Banach space, then is a mapping from E onto
- (III)
- If E is smooth Banach space, then single valued.
- (IV)
- If E is a uniformly smooth Banach space, then is norm-to-norm uniformly continuous on each bounded subset of
Lemma 3.
Ref. [32] For any with the following inequality holds:
We now define some important operators which play key role in our convergence analysis.
Definition 5.
Let be a multi-valued mapping. We define the effective domain of A by and range of A by The operator A is said to be monotone if for all and When the graph of A is not properly contained in the graph of any other monotone operator, then we say that A is maximally monotone.
Let E be a smooth, strictly convex, and reflexive Banach space and be a maximal monotone operator. The metric resolvent operator with respect to A is defined by It is easy to see that
and for all (see, e.g., [20]). Moreover, by the monotonicity of we can show that
for all In addition, if then
for all and In the case with we denote by (see, e.g., [33]).
Proposition 1.
Ref. [30] Let be an operator satisfying the following range condition
Define the φ-resolvent operator associated with operator A by
Then, for any and we see that
Proposition 2.
Ref. [30] Let C be a nonempty, closed, and convex subset of a reflexive, strictly convex Banach space E and let be the duality mapping with gauge Let be a monotone operator satisfying the condition where Let be a resolvent operator of then,
- (a)
- is φ-firmly non-expansive mapping from C into
- (b)
Let E be a uniformly convex and smooth Banach space. Let A be a monotone operator of E into From Browder [34], we know that A is maximal if and only if, for any
Remark 2.
- (i)
- The smoothness and strict convexity of E ensures that is single-valued. In addition, the range condition ensure that single-valued operator from C into In other words,
- (ii)
- When A is maximal monotone, the range condition holds for
In the sequel, we denote by for convenience.
Let E and F be real Banach spaces and let be a bounded linear. The dual (adjoint) operator of denoted by is a bounded linear operator defined by
and the equalities and are valid, where (see [35,36] for more details on bounded linear operators and their duals).
Lemma 4.
Ref.[9] Let E and F be uniformly convex and smooth Banach spaces, Let be a bounded linear operator with the adjoint operator Let be the resolvent operator associated with a maximal monotone operator A on E and let be a metric resolvent associated with a maximal monotone operator B on Assume that Let and Then, the following are equivalent:
- (a)
- and
- (b)
3. Main Results
In this section, we present our algorithm and its convergence analysis. In the sequel, we assume that the following assumption hold.
- (i)
- and are two p-uniformly convex and uniformly smooth real Banach spaces.
- (ii)
- is a bounded linear operator with with adjoint .
- (iii)
- and are maximal monotone operators.
- (iv)
- is the resolvent operator associated with A and is the metric resolvent operator associated with B.
In addition, we denote by and the duality mappings of and , respectively, while is the duality mapping of It is worth mentioning that, when and are two q-uniformly smooth and uniformly convex Banach spaces, where with
Algorithm SASPM:
Given initial values the sequence generated by the following iterative algorithm:
where is a Bregman projection of onto the sequence of real number and , and satisfying
To prove the convergence analysis of Algorithm SASPM, we first prove some useful results.
Lemma 5.
Let be a p-uniformly convex and uniformly smooth real Banach space, and Then, for any sequence and in , the set
is closed and convex for each
Proof.
First, since is closed and convex. Then, we assume that is a closed and convex. For each by the definition of the function we have
and
Hence, we know that is closed. In addition, we easily prove that is convex. The proof is completed. □
Lemma 6.
Let T B, and be the same as above such that Conditions (1)–(4) are satisfied. If then for any
Proof.
If it is obvious that Conversely, for any according to Lemma 3 and using the fact that the resolvent is non-expansive, we easily obtain
From (20), let for all where We see from Lemma 1 that
On the other hand, observe that
Theorem 1.
Let B, and be the same as above such that Conditions (1)–(4) are satisfied. If then the sequence generated by Algorithm (20) converges strongly to a point
Proof.
By Lemmas 5 and 6, we know that is well defined and According to Algorithm (20), we know that and for each Using and (16), we have
It implies that is bounded. Reusing (16), we also have
It follows that is nondecreasing. Hence, the limit exists, and
It follows from (13) that
For some positive with we have Using (16), we obtain
Since the limit exists, it follows from (31) that and Therefore, is Cauchy sequence. Further, there exists a point such that
From Algorithm (20), Definition 2, and Lemma 1, we have
By virtue of Remark 1 and the definition of we know
By (32) and (33), we get Then, using (13) and (30) and the boundedness of the sequence we can obtain
Using a similar method, we can get
By setting we have
Since we have
As is norm to norm uniformly continuous on a bounded subset of we obtain
Since is a p-uniformly convex and uniformly smooth real Banach space, then is uniformly norm-to-norm continuous. Thus, it follows from Algorithm (20) and real number sequence in that
which also implies that From (25), and z being in we get
This implies that
By setting of the right-hand side of the last inequality tends to This implies that
Since we get
and hence
Hence,
In addition,
Since as , there exists a subsequence of such that as well as as there exists a subsequence of such that From and by the boundedness and linearity of we have and Since is a metric resolvent on B for we have
for all thus we obtain
for all It follows that
for all Since B is maximal monotone, and hence
Let and
Note that
By the monotonicity of it follows that
for all Then,
Since (40) and (43), it follows that and hence This concludes that Then, from (28) and (20), we have
By setting in (44), we obtain
As a corollary of Theorem 1, when and reduces to Hilbert spaces, the function is equal to and the Bregman projection is equivalent to the metric projection Then, we obtain the following result.
Theorem 2.
Let and be Hilbert spaces, and be maximal monotone operators, be a bounded linear operator with , and be the adjoint of Let be the resolvent operator associated with a maximal monotone operator A on and be metric resolvent associated with a maximal monotone operator B on Suppose that For fixed let be iteratively generated by and
where is the metric projection of onto the sequence of real numbers, and , and Then, the sequence generated by (46) converges strongly to a point
4. Applications
In this section, we provide some applications of our result to solving other nonlinear optimization problems.
4.1. Application to Minimization Problem
First, we consider an application of our result to convex minimization problem in real Banach space E. Let be a proper, convex and lower semicontinuous function. The convex minimization problem is to find such that
The set of minimizer of is denoted by The subdifferential of of is defined as follows
for all From Rockafellar [37], it is known that is a maximal monotone operator. Let C be a nonempty, closed, and convex subset of E and let be the indicator function of C i.e.,
Then, is a proper, convex, and lower semicontinuous function on Thus, the subdifferential of is a maximal monotone operator. Then, we can define the resolvent of for i.e.,
for all and We have that for any and
Let and be real Banach spaces and and be proper, lower semicontinuous, and convex functions such that and Consider the Split Proximal Feasibility Problem (SPFP) defined by: Find such that
where and We denote the solution set of (47) by The PSFP is a generalization of the split feasibility problem and has been studied extensively by many authors in real Hilbert space (see, e.g., [38,39,40,41,42]).
By setting and , we obtain a strong convergence result for solving (47) in real Banach spaces.
Theorem 3.
Let be a p-uniformly convex and uniformly smooth Banach space and be a uniformly convex smooth Banach space. Let ϑ and ξ be proper, lower semicontinuous, and convex functions of into and into such that and respectively. Let be a bounded linear operator such that and let be the adjoint operator Suppose that For fixed let be iteratively generated by and
where is a Bregman projection of onto the sequence of real number and , and satisfies
where is the uniform smoothness coefficient of . Then,
where
Proof.
We know from [43] that
is equivalent to
From this, we have i.e., Similarly, we have that
is equivalent to Using Theorem 1, we get the conclusion. □
4.2. Application to Equilibrium Problem
Let C be a nonempty closed and convex subset of a Banach space E and let be a bifunction. For solving the equilibrium problem, we assume that G satisfies the following conditions:
- (A1)
- (A2)
- G is monotone, i.e., for any
- (A3)
- G is upper-hemicontinuous, i.e., for each
- (A4)
- is convex and lower semicontinuous for each
The equilibrium problem is to find such that
The set of solution of this problem is denoted by
Lemma 7.
[44] Let be super coercive Legendre function, G be a bifunction of into satisfying Conditions (A1)–(A4), and Define a mapping as follows:
Then,
- (i)
- .
- (ii)
- is single-valued.
- (iii)
- is a Bregman firmly nonexpansive operator.
- (iv)
- The set of fixed point of is the solution set of the corresponding equilibrium problem, i.e., .
- (v)
- is closed and convex.
- (vi)
- For all and for all we have
Proposition 3.
[45] Let be a super coercive Legendre Frécht differentiable and totally convex function. Let C be a closed and convex subset of E and assume that the bifunction satisfies the Conditions (A1)–(A4). Let be a set-valued mapping of E into defined by
Then, is a maximal monotone operator, and
Let and real Banach spaces and C and Q be nonempty, closed, and convex subsets of and , respectively. Let and be bifunctions satisfying Conditions (A1)–(A4) and be a bounded linear operator. We consider the Split Equilibrium Problem (SEP) defined by: Find such that
The SEP was introduced by Moudafi [46] and has been studied by many authors for Hilbert and Banach spaces (see, e.g., [47,48,49,50]). We denote the set of solution of (49) by
Setting and in Algorithm (20), Lemma 7, and Proposition 3, we obtain a strong convergence result for solving SEP in real Banach spaces.
Theorem T4.
Let be a p-uniformly convex and uniformly smooth Banach space, be a uniformly smooth Banach space, and C and Q be nonempty closed subsets of and , respectively. Let and be bifunctions satisfying Conditions (A1)–(A4) and and be super coercive Legendre functions which are bounded, uniformly Frechet differentiable, and totally convex on bounded subset of Let be a bounded linear operator with and be the adjoint of Suppose that for fixed , let be iteratively generated by , and
where and is a Bregman projection of onto the sequence of real number and and satisfies
where is the uniform smoothness coefficient of . Then,
5. Conclusions
In this paper, we introduce a new inertial shrinking projection method for solving the split common null point problem in uniformly convex and uniformly smooth real Banach spaces. The algorithm is designed such that its step size does not require prior knowledge of the norm of the bounded linear operator. A strong convergence result is also proved under some mild conditions. We further provide some applications of our result to other nonlinear optimization problems. We highlight our contributions in this paper as follow:
- A significant improvement in this paper is that a self-adaptive technique is introduced for selecting the step size such that a strong convergence result is proved without prior knowledge of the norm of the bounded linear operator. This improves the results in [6,8,9,11,12,16,19,20] and other important results in this direction.
- The result in this paper extends the results in [4,5,10,11] and several other results on solving split common null point problem from real Hilbert spaces to real Banach spaces.
- The strong convergence result in this paper is more desirable in optimization theory (see, e.g., [51]).
Author Contributions
Conceptualization, C.C.O.; methodology, C.C.O. and L.O.J.; software, C.C.O. and L.O.J.; validation, C.C.O., L.O.J. and R.N.; formal analysis, C.C.O.and L.O.J.; writing–original draft preparation, C.C.O. and L.O.J.; writing–review and editing, C.C.O., L.O.J. and R.N.; supervision, L.O.J.; project administration, C.C.O.; funding acquisition, L.O.J. All authors have read and agreed to the published version of the manuscript.
Funding
This research is funded by the Mathematical research fund at the Sefako Makgatho Health Sciences University.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Byrne, C.; Censor, Y.; Gibali, A.; Reich, S. The split common null point problem. J. Nonlinear Convex Anal. 2012, 13, 759–775. [Google Scholar]
- Bruck, R.E.; Reich, S. Nonexpansive projections and resolvents of accretive operators in Banach spaces. Houst. J. Math. 1977, 3, 459–470. [Google Scholar]
- Censor, Y.; Elfving, T. A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 1994, 8, 221–239. [Google Scholar] [CrossRef]
- Censor, Y.; Segal, A. The split common fixed-point problem for directed operators. J. Convex Anal. 2009, 16, 587–600. [Google Scholar]
- Muodafi, A. The split common fixed point problem for demicontractive mappings. Inverse Probl. 2010, 26, 055007. [Google Scholar] [CrossRef] [PubMed]
- Alofi, A.S.; Alsulami, S.M.; Takahashi, W. Strongly convergent iterative method for the split common null point problem in Banach spaces. J. Nonlinear Convex Anal. 2016, 17, 311–324. [Google Scholar]
- Alsulami, S.M.; Takahashi, W. The split common null problem for maximal monotone mappings in Hilbert spaces and applications in Banach spaces. J. Nonlinear Convex Anal. 2014, 15, 793–808. [Google Scholar]
- Takahashi, W. The split common null point problem in Banach space. Arch. Math. 2015, 104, 357–365. [Google Scholar] [CrossRef]
- Suantai, S.; Shehu, Y.; Cholamjiak, P. Nonlinear iterative methods for solving the split common null point problem in Banach spaces. Optim. Method Softw. 2019, 34, 853–874. [Google Scholar] [CrossRef]
- Kazmi, K.R.; Rizvi, S.H. An iterative method for split variational inclusion problem and fixed point problem for a nonexpansive mapping. Optim. Lett. 2014, 8, 1113–1124. [Google Scholar] [CrossRef]
- Jailoka, P.; Suantai, S. Split null point problems and fixed point problems for demicontractive multivalued mappings. Meditter. J. Math. 2018, 15, 204. [Google Scholar] [CrossRef]
- Sitthithakerngkiet, K.; Deepho, J.; Kumam, P. Convergence analysis of a general iterative algorithm for finding a common solution o split variational inclusion and optimization problems. Numer. Algorithms 2018, 79, 801–824. [Google Scholar] [CrossRef]
- Dong, Q.L.; He, S.; Zhao, J. Solving the split equality problem without prior knowledge of operator norms. Optimization 2015, 64, 1887–1906. [Google Scholar] [CrossRef]
- Zhao, J. Solving split equality fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operators norms. Optimization 2015, 64, 2619–2630. [Google Scholar] [CrossRef]
- Zhao, J.; Zhang, H. Solving split common fixed-point problem of firmly quasi-nonexpansive mappings without prior knowledge of operators norms. Abstr. Appl. Anal. 2014, 389689. [Google Scholar] [CrossRef]
- Takahashi, W. The split common null point problem in two Banach spaces. J. Nonlinear Convex Anal. 2015, 16, 2343–2350. [Google Scholar]
- Takahashi, S.; Takahashi, W. The split common null point problem and the shrinking projection method in Banach spaces. Optimization 2016, 65, 281–287. [Google Scholar] [CrossRef]
- Suantai, S.; Srisap, K.; Naprang, N.; Mamat, M.; Yundon, V.; Cholamjiak, P. Convergence Theorems for finding split common null point problem in Banach spaces. Appl. Gen. Topol. 2017, 18, 345–360. [Google Scholar] [CrossRef]
- Takahashi, W. The split common null point problem for generalized resolvents in two banach spaces. Numer. Algorithms 2017, 75, 1065–1078. [Google Scholar] [CrossRef]
- Takahashi, W. The split feasibility problem in Banach spaces. Nonlinear Convex Anal. 2014, 15, 1349–1355. [Google Scholar]
- Polyak, B.T. Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Phys. 1964, 4, 1–17. [Google Scholar] [CrossRef]
- Alvarez, F.; Attouch, H. An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set Valued Anal. 2001, 9, 3–11. [Google Scholar] [CrossRef]
- Attouch, H.; Peypouquet, J.; Redont, P. A dynamical approach to an inertial forward-backward algorithm for convex minimization. SIAM J. Optim. 2014, 24, 232–256. [Google Scholar] [CrossRef]
- Bot, R.I.; Csetnek, E.R.; Hendrich, C. Inertial Douglas–Rachford splitting for monotone inclusion. Appl. Math. Comput. 2015, 256, 472–487. [Google Scholar]
- Bot, R.I.; Csetnek, E.R. An inertial alternating direction method of multipliers. Minimax Theory Appl. 2016, 1, 29–49. [Google Scholar]
- Bot, R.I.; Csetnek, E.R. An inertial forward–backward–forward primal-dual splitting algorithm for solving monotone inclusion problems. Numer. Algebra 2016, 71, 519–540. [Google Scholar] [CrossRef]
- Dong, Q.L.; Yuan, H.B.; Cho, Y.J.; Rassias, T.M. Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings. Optim. Lett. 2018, 12, 87–102. [Google Scholar] [CrossRef]
- Cholamjiak, W.; Pholasa, N.; Suantai, S. A modified inertial shrinking projection method for solving inclusion problems and quasi nonepansive multivalued mappings. Comput. Appl. Math. 2018, 34, 5750–5774. [Google Scholar] [CrossRef]
- Cioranescu, I. Geometry of Banach Spaces, Duality Mappings and Nonlinear Problems; Kluwer: Doradrecht, The Netherlands, 1990; Volume 62. [Google Scholar]
- Kuo, L.-W.; Sahu, D.R. Bregman distance and strong convergence of proximal-type algorithms. Abstr. Appl. Anal. 2003, 2003, 590519. [Google Scholar] [CrossRef]
- Xu, H.K. Inequalities in Banach spaces with applications. Nonlinear Anal. 1991, 16, 1127–1138. [Google Scholar] [CrossRef]
- Shehu, Y.; Ogbuisi, F.; Iyiola, O. Convergence analysis of an iterative algorithm for fixed point problems and split feasibility problems in certain Banach spaces. Optimization 2016, 65, 299–323. [Google Scholar] [CrossRef]
- Aoyama, K.; Kohsaka, F.; Takahashi, W. Three generalizations of firmly nonexpansive mappings: Their relations and continuity properties. J. Nonlinear Convex Anal. 2009, 10, 131–147. [Google Scholar]
- Browder, F.E. Nonlinear maximal monotone operators in Banach space. Math. Ann. 1968, 175, 89–113. [Google Scholar] [CrossRef]
- Dunford, N.; Schwartz, J.T. Linear Operators I; Willey Interscience: New York, NY, USA, 1958. [Google Scholar]
- Takahashi, W. Nonlinear Functional Analysis; Yokohama Publishers: Yokohama, Japan, 2000. [Google Scholar]
- Rockafellar, R.T. On the maximality of sums of nonlinear monotone operators. Trans. Am. Math. Soc. 1970, 149, 75–88. [Google Scholar] [CrossRef]
- Muodafi, A.; Thakur, B.S. Solving proximal split feasibility problems without prior knowledge of operator norms. Optim. Lett. 2014, 8, 2099–2110. [Google Scholar] [CrossRef]
- Shehu, Y.; Cai, G.; Iyiola, O.S. Iterative approximation of solutions for proximal split feasibility problems. Fixed Point Theory Appl. 2015, 2015, 123. [Google Scholar] [CrossRef]
- Shehu, Y.; Ogbuisi, F.U. Convergence analysis for proximal split feasibility problems and fixed point problems. J. Appl. Math. Comput. 2015, 48, 221–239. [Google Scholar] [CrossRef]
- Pant, R.; Okeke, C.C.; Izuchukwu, C. Modified viscosity implicit rules for proximal split feasibility problem. J. Appl. Math. Comput. 2020. [Google Scholar] [CrossRef]
- Yao, Y.; Yao, Z.; Abdou, A.; Cho, Y. Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis. Fixed Point Theory Appl. 2015, 2015, 205. [Google Scholar] [CrossRef]
- Barbu, V. Nonlinear Semigroups and Differential Equations in Banach Spaces. Editura Acad. R. S. R., Bucuresti; Springer: Berlin/Heidelberg, Germany, 1976. [Google Scholar]
- Reich, S.; Sabach, S. Two strong convergence Theorems for a proximal method in reflexive Banach spaces. Numer. Funct. Anal. Optim. 2010, 31, 22–44. [Google Scholar] [CrossRef]
- Sabach, S. Products of finitely many resolvents of maximal monotone mappings in reflexive banach spaces. SIAM J. Optim. 2011, 21, 1289–1308. [Google Scholar] [CrossRef]
- Moudafi, A. Split monotone variational inclusions. J. Optim. Theory Appl. 2011, 150, 275–283. [Google Scholar] [CrossRef]
- Kazmi, K.R.; Rizvi, S.H. Iterative approximation of a common solution of a split equilibrium problem, a variational inequality problem and a fixed point problem. J. Egypt. Math. Soc. 2013, 21, 44–51. [Google Scholar] [CrossRef]
- Jolaoso, L.O.; Oyewole, O.K.; Okeke, C.C.; Mewomo, O.T. A unified algorithm for solving split generalized mixed equilibrium problem and fixed point of nonspreading mapping in Hilbert space. Demonstr. Math. 2018, 51, 211–232. [Google Scholar] [CrossRef]
- Jolaoso, L.O.; Karahan, I. A general alternative regularization method with line search technique for solving split equilibrium and fixed point problems in Hilbert space. Comput. Appl. Math. 2020, 30. [Google Scholar] [CrossRef]
- Okeke, C.C.; Jolaoso, L.O.; Isiogugu, F.O.; Mewomo, O.T. Solving split equality equilibrium and fixed point problems in Banach spaces without prior knowledge of operator norm. J. Nonlinear Convex Analy. 2019, 20, 661–683. [Google Scholar]
- Bauschke, H.H.; Combettes, P.L. A weak-to-strong convergence principle for Féjer-monotone methods in Hilbert spaces. Math. Oper. Res. 2001, 26, 248–264. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).