Abstract
Some new forward–backward multi-choice iterative algorithms with superposition perturbations are presented in a real Hilbert space for approximating common solution of monotone inclusions and variational inequalities. Some new ideas of constructing iterative elements can be found and strong convergence theorems are proved under mild restrictions, which extend and complement some already existing work.
Keywords:
monotone inclusions; multi-choice iterative algorithm; θ-inversely strongly monotone operator; superposition perturbation; variational inequality MSC:
47H05; 47H09
1. Introduction and Preliminaries
Let C be a non-empty closed and convex subset of a real Hilbert space Symbols and denote the norm and inner-product of H, respectively. Symbols → and ⇀ denote the strong and weak convergence in respectively.
The classical variational inequality [1] is to find such that for any ,
where is a nonlinear mapping. We use to denote the set of solutions of the variational inequality (1).
The theory of variational inequality draws much attention of mathematicians due to its wide application in several branches of pure and applied sciences [1]. Until now, it is still a hot topic (see [2,3,4,5,6] and the references therein).
An operator is called monotone ([7]) if for each there exist and such that The monotone operator A is called maximal monotone if for any In a Hilbert space, a maximal monotone operator can also be called an m-accretive mapping.
A mapping is called a -inversely strongly monotone operator ([8]) if for each and
Let be a mapping. If and then x is called a zero point of The set of zero points of U is denoted by If satisfies that then x is called a fixed point of U. The set of fixed points of U is denoted by
The monotone inclusion problem is to find such that
where is maximal monotone and is -inversely strongly monotone. The study of monotone inclusions is a hot topic since quite a lot problems appear in minimization problem, convex programming, split feasibility problems, variational inequalities, inverse problem, and image processing can be modeled by it. The construction of iterative algorithms for approximating the solution of (2) has been considered (see [8,9,10,11,12,13,14] and the references therein). The forward–backward splitting iterative method is one of them, which means an iteration involves only A as the forward step and B as the backward step, not the sum The classical forward–backward splitting iterative method is as follows:
Some of the related work can be seen in [9,10] (and the references therein).
Recall that is called a contraction with contractive constant k ([15]) if is that for
A mapping is called non-expansive ([15]) if for
A mapping is called a strongly positive mapping with ([15]) if such that for Furthermore,
where I is the identity mapping, , and
In [15], the study of monotone inclusion (2) is extended to the system of monotone inclusions:
for where is maximal monotone and is -inversely strongly monotone, for
Moreover, the iterative algorithm presented in [15] is proved to be strongly convergent to not only the solution of monotone inclusions (3) but also the solution of one kind variational inequality. Specially, the authors constructed the following one by combining the ideas of the splitting method and the midpoint method:
where f is a contraction, F is a strongly positive linear bounded mapping, and is the metric projection. Under some conditions, and solves the following variational inequality:
Recall that is called -strongly monotone ([16]) if for each ,
for some . Furthermore, is called -strictly pseudo-contractive ([16]) if for each ,
for some
In 2012, Ceng et al. proposed an iterative algorithm with a perturbed operator for approximating a zero point of the maximal monotone operator A in a Hilbert space ([16]).
where is a -strongly monotone and -strictly pseudo-contractive mapping with is a contraction, and is maximal monotone. Under some assumptions, is proved to be convergent strongly to the unique element which solves the following variational inequality:
The mapping T, which is called a perturbed operator, only plays a role in the construction of the iterative algorithm (6) for selecting a particular zero point of A, but it is not involved in the variational inequality (7).
Later, in 2017, the work in (6) is extended to approximate the solutions of the systems of monotone inclusions (3). The following is a special case in Hilbert space presented in [17]:
In (8), is called a superposition perturbation, where is perturbed operator in the sense of (6); that is, is a -strongly monotone and -strictly pseudo-contractive mapping, for each
The iterative sequence generated by (8) is proved to be strongly convergent to which solves the variational inequality:
In 2019, Wei et al., proposed some new iterative algorithms. The inertial forward–backward iterative algorithm for approximating the solution of monotone inclusions (3) in [18] is as follows:
The result that as is proved under some conditions.
The mid-point inertial forward–backward iterative algorithm in [18] is presented as follows:
where f is a contraction and F is a strongly positive linear bounded mapping. The result that as is proved under some conditions. Furthermore, under the additional assumptions that and , one has that solves the variational inequality
The inertial forward–backward iterative algorithm for approximating common solution of monotone inclusions and one kind variational inequalities, where is maximal monotone and -Lipschitz continuous, is presented as follows in [18]:
The result that , as , is proved.
Although two sets and are needed in (10)–(12), infinite choices of iterative sequences can be made from them whose idea is totally different from that in (4) or (8).
Motivated by the above work, in this paper, we construct some new forward–backward multi-choice iterative algorithms with superposition perturbations in a Hilbert space. Furthermore, some strong convergence theorems for approximating common solution of monotone inclusions and variational inequalities are proved under mild conditions.
To begin our study, the following preliminaries are needed.
Definition 1
([19]). There exists a unique element such that for each Define the metric projection mapping by , for any
Lemma 1
([20]). For a contraction , there is a unique element that satisfies
Lemma 2
([19]). For a monotone operator and one has that is non-expansive.
Lemma 3
([21]). If is non-expansive for and for then is non-expansive with under the assumption that
Lemma 4
([15]). If is a single-valued mapping and is maximal monotone, then
for
Definition 2
([22]). Suppose is a sequence of non-empty closed and convex subsets of H. One has:
(1) The strong lower limit of , is defined as the set of all such that there exists for almost all n and it tends to x as in the norm.
(2) The weak upper limit of is defined as the set of all such that there exists a subsequence of and for every and it tends to x as in the weak topology;.
(3) The limit of is the common value when .
Lemma 5
([22]). Let be a decreasing sequence of closed and convex subsets of H, i.e., if Then, converges in H and
Lemma 6
([23]). If exists and is not empty, then for every as
Lemma 7
([24]). Let . Then, there exists a continuous, strictly increasing and convex function with such that for with and .
Lemma 8
([25]). Let be a ϑ-strongly monotone and μ-strictly pseudo-contractive mapping with . Then, for any fixed number , is a contraction with contractive constant .
Lemma 9
([15]). Suppose is strongly positive bounded mapping with coefficient and then
Lemma 10
([15]). Let be a contraction with contractive constant , be strongly positive bounded mapping with coefficient and be a non-expansive mapping. Suppose and . If for each define by
then has a fixed point , for each Moreover, as where which satisfies the variational inequality:
Lemma 11
([15]). In a real Hilbert space H, the following inequality holds:
Lemma 12
([26]). Let and be two sequences of non-negative real number sequences satisfying
where with and , as . If , then
Lemma 13
([17]). Let H be a real Hilbert space, be maximal monotone, be -inversely strongly monotone, and be -strongly monotone and -strictly pseudo-contractive with for Suppose for and for and If, for each is defined by
then has a fixed point That is,
Moreover, if then as where is the solution of variational inequality:
2. Strong Convergence Theorems
Our discussion is based on the following assumptions in this section:
- (a)
- H is a real Hilbert space.
- (b)
- is maximal monotone and is -inversely strongly monotone, for each .
- (c)
- is a contraction with contractive constant . Furthermore, if then or for .
- (d)
- is a strongly positive linear bounded mapping with and for .
- (e)
- is -strongly monotone and -strictly pseudo-contractive, for ;.
- (f)
- and are the computational errors.
- (g)
- and are two real number sequences in with for
- (h)
- , , , , and are real number sequences in for
- (i)
- and are real number sequences in , for
Theorem 1.
Let be generated by the following iterative algorithm:
Under the assumptions that:
- (i)
- (ii)
- and for
- (iii)
- for
- (iv)
- and , as .
- (v)
- .
- (vi)
- and .
- (vii)
- as .
- (viii)
- and ,
one has as where satisfies the following variational inequalities:
and
Moreover, as , which means
Proof.
We split the proof into eleven steps.
- Step 1. is well-defined.
For define by
for any and for fixed element , where is any fixed non-expansive mapping.
It is easy to check that Thus, is a contraction, which ensures from Lemma 1 that there exists such that That is,
Since for for any
This ensures that is non-expansive, for Since , from Lemmas 2–4, one has is non-expansive, for Moreover,
Considering T in (16) as one can see that is well-defined.
- Step 2. is non-empty closed and convex subset of H, for any
We can easily know from the construction of that is closed and convex subset of H, for any We are left to show that For this, it suffices to show that for
In fact, for any one has
Then,
which implies that for Therefore, for all and then for all
- Step 3. is a non-empty subset of H, for each which ensures that is well-defined.
It follows from Step 2 and Definition 1 that, for there exists such that Thus, for Then, is well-defined.
- Step 4. as .
It follows from Lemma 5 that exists and . Then, Lemma 6 implies that as .
- Step 5. as .
Since and is a convex subset of H, for which implies that
Using Lemma 7, one has:
From (17) and (18), we have Letting first and then , one has as Combining with Step 4, as .
- Step 6. and are all bounded.
For one has for any
Furthermore, implies that for any
In view of Lemma 8 and (20), one has
Note that, for any
Now, in view of Lemma 9, one has
Combing with inequalities (19)–(23), by induction, one has
Based on the assumptions, one has is bounded. Following (19)–(22), it is easy to see that and are all bounded.
Note that, for Then, is bounded. Similarly, is bounded.
Since then is bounded.
- Step 7. There exists which is the solution of variational inclusion (14).
It follows from Lemma 10 that there exists such that
and as where is the solution of (14).
- Step 8. where is the same as that in Step 7.
Note that
Furthermore,
Since ,,, , and are bounded, then, based on the assumptions and (24) and (25), as
Let be the same as that in Step 7, then which implies that is bounded.
Note that
Since and as then as In view of Lemma 11,
Therefore,
which implies that
Since as then
Since and then
- Step 9. as , where is the same as that in Steps 7 and 8.
In fact, using Lemma 11 again, one has
Furthermore, ensures that
In view of Lemma 11 again, one has
Note that
Now, in view of Lemma 9 and using (27)–(30), one has
Let . Then, from Step 6, one has
Therefore, it follows from (31) that
If we set , then (32) can be reduced as follows:
Based on the assumptions and Step 8, we know that and Then, from Lemma 12, as .
- Step 10. There exists which is the solution of the variational inclusion
In fact, it follows from Lemma 13 that there exists such that
and as where is the solution of (33).
- Step 11. as , where is the same as that in Step 10.
It suffices to show that .
Since ,
Since F is strongly positive linear bounded, f is a contraction, and ,
Therefore, (34) ensures that
On the other hand, it follows from (33) that
Combining with (34), one has Following Condition (d), we know that Then, (34) and (37) ensure that
Since from Condition (c), we know that or If then the result follows. If then implies that Therefore, Since then , which means that Therefore, as
This completes the proof. □
Theorem 2.
Let be generated by the following iterative algorithm:
Under the assumptions of Theorem 1, one has
as where is the unique solution of the system of variational inclusions (14) and (15). Moreover, as .
Proof.
The proof is split into eleven steps. Copy Steps 2–5, 7, 10 and 11 in Theorem 1. Furthermore, modify the other steps in Theorem 1 as follows
Step 1. is well-defined.
For define by for any and for fixed , where is any fixed non-expansive mapping.
It is easy to check that Thus, is a contraction, which ensures from Lemma 1 that there exists such that That is,
Considering T here as similar to Step 1 of Theorem 1, one can see that is well-defined.
Step 6. , and are all bounded.
For one has
This implies that (20) is still true.
In view of Lemma 8 and (20), one has
which ensures that (21) is still true.
Note that
Combining with inequalities (19)–(21) and (39), one has
Therefore, is bounded. Similar to Step 6 in Theorem 1, , , , , and are all bounded.
Step 8. where is the same as that in Step 7.
Note that
Furthermore,
Based on the assumptions, (40) and (41), and Step 6, one has as Copying the corresponding part of Step 8 in Theorem 1, one can see that .
Step 9. as , where is the same as that in Steps 7 and 8.
Similar to Step 9 in Theorem 1, we can easily see that both (27) and (28) are still true.
In view of Lemma 11 and (28), one has
Note that
Now, in view of Lemma 9 and using (27), (28), (42), and (43), one has
Therefore,
where
If we set , then
Similar to Step 9 in Theorem 1, in view of Lemma 12, we have as .
This completes the proof. □
Remark 1.
The restrictions imposed on the mappings and are available. For example, take and for Take . Then, we can easily see that F is a strongly positive linear bounded mapping with ξ, f is a contraction, and . Moreover, for Furthermore, if then which implies that or
Remark 2.
In both (13) and (38), the idea of forward–backward splitting method is embodied, the superposition perturbation is considered and multi-choice sets are constructed, which extends and complements the corresponding studies.
Remark 3.
From Theorems 1 and 2, we may find that the limit of the iterative sequence is not only the solution of the system of monotone inclusions (3) but also the solution of variational inequalities (14) and (15). That is, the study on iterative construction of the solution of (14) in [18] and the solution of (15) in [17] are unified in our paper.
Remark 4.
From Theorems 1 and 2, we may find that the relationship between the metric projection and the common solution of variational inequalities and monotone inclusions is set up in our paper.
3. Applications
In this section, one kind capillarity system discussed in [18] is employed again to demonstrate the application of Theorems 1 and 2.
The discussion begins under the following assumptions:
- (1)
- is a bounded conical domain in () with its boundary
- (2)
- is the exterior normal derivative of
- (3)
- is a positive number, for
- (4)
- , for Moreover, if then suppose , for . If then suppose , for
- (5)
- denotes the norm in and the inner-product.
Now, examine the capillarity systems:
Lemma 14.
(see [18]) For define by
- (1)
- where is defined byfor any
- (2)
- .
Then, is maximal monotone, for each .
Lemma 15.
(see [18]) Define by
and then is -inversely strongly accretive, for and
Lemma 16.
(see [18]) If, in (46), where k is a constant, then is the solution of capillarity system (46). Furthermore,
Theorem 3.
Suppose and are the same as those in Lemmas 14 and 15, is a strongly positive linear bounded operator with coefficient , is a contraction with coefficient and is -strongly monotone and -strictly pseudo-contractive mapping, for
Two iterative algorithms are constructed as follows:
and
Under the assumptions of Theorems 1 and 2, one has where is common solution of the capillarity system (46) and the system of variational inclusions (14) and (15).
4. Conclusions
Some new forward–backward multi-choice iterative algorithm with superposition perturbations are presented in a real Hilbert space. The iterative sequences are proved to be strongly convergent to not only the solution of monotone inclusions but also the solution of variational inequalities. In the near future, more work can be done to weaken the restrictions imposed on the contraction f and the strongly positive linear bounded mapping F.
Author Contributions
Conceptualization, L.W., X.-W.S. and R.P.A.; methodology, L.W., X.-W.S. and R.P.A.; software, L.W., X.-W.S. and R.P.A.; validation, L.W., X.-W.S. and R.P.A.; formal analysis, L.W., X.-W.S. and R.P.A.; investigation, L.W., X.-W.S. and R.P.A.; resources, L.W., X.-W.S. and R.P.A.; data curation, L.W., X.-W.S. and R.P.A.; writing—original draft preparation, L.W., X.-W.S. and R.P.A.; writing—review and editing, L.W., X.-W.S. and R.P.A.; visualization, L.W., X.-W.S. and R.P.A.; supervision, L.W., X.-W.S. and R.P.A. All authors have read and agreed to the published version of the manuscript.
Funding
Li Wei was supported by Natural Science Foundation of Hebei Province (A2019207064), Key Project of Science and Research of Hebei Educational Department (ZD2019073), and Key Project of Science and Research of Hebei University of Economics and Business (2018ZD06).
Conflicts of Interest
The authors declare no conflict of interest.
References
- Kinderleher, D.; Stampacchia, G. An Introduction to Variational Inequalities and Their Applications; Academic Press: London, UK, 1980. [Google Scholar]
- Jolaoso, L.O.; Shehu, Y.; Cho, Y.J. Convergence analysis for variational inequalities ad fixed point problems in reflexive Banach space. J. Inequal. Appl. 2021, 44. [Google Scholar] [CrossRef]
- Ceng, L.C.; Petrusel, A.; Qin, X.L.; Yao, J.C. A modified inertial subgradient extragradient method for solving pseudomonotone variational inequalities and common fixed point problems. Fixed Point Theory 2020, 21, 93–108. [Google Scholar] [CrossRef]
- Cai, G.; Gibali, A.; Lyiola, O.S.; Shehu, Y. A new donble-projection method for solving variational inequalities in Banach spaces. J. Optim. Theory Appl. 2018, 178, 219–239. [Google Scholar] [CrossRef]
- Jolaoso, L.O.; Taiwo, A.; Alakoya, T.O.; Mewomo, O.T. A unified algorithm for solving variational inequality and fixed point problems with application to the split equality problem. Comput. Appl. Math. 2020, 39, 38. [Google Scholar] [CrossRef]
- Cheng, Q.Q. Parallel hybrid viscosity method for fixed point problems, variational inequality problems nd split generalized equilibrium problems. J. Inequal. Appl. 2019, 2019, 1–25. [Google Scholar] [CrossRef]
- Pascali, D.; Sburlan, S. Nonlinear Mappings of Mnotone Type; Sijthhoff & Noordhoff International Publishers: Alphen ann den Rijn, The Netherlands, 1978. [Google Scholar]
- Wei, L.; Shi, A.F. Splitting-midpoint method for zeros of the sum of accretive operator and μ-inversely strongly accretive operator in a q-uniformly smooth Banach space and its applications. J. Inequal. Appl. 2015, 2015, 1–17. [Google Scholar] [CrossRef][Green Version]
- Combettes, P.L.; Wajs, V.R. Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 2005, 4, 1168–1200. [Google Scholar] [CrossRef]
- Tseng, P. A mordified forward-backward splitting method for maximal monotone mappings. SIAM J. Control Optim. 2000, 38, 431–446. [Google Scholar] [CrossRef]
- Khan, S.A.; Suantai, S.; Cholamjiak, W. Shrinking projection methods involving inertial forward-backward splitting methods for inclusion problems. Rev. Real Acad. Cienc. Exactas Fís. Nat. Ser. Mat. 2019, 113, 645–656. [Google Scholar] [CrossRef]
- Lorenz, D.; Pock, T. An inertial forward-backward algorithm for monotone inclusions. J. Math. Imaging Vis. 2015, 51, 311–325. [Google Scholar] [CrossRef]
- Dong, Q.L.; Jiang, D.; Cholamjiak, P.; Shehu, Y. A strong convergence result involving an inertial forward-backward algorithm for monotone inlusions. J. Fixed Point Theory Appl. 2017, 19, 3097–3118. [Google Scholar] [CrossRef]
- Qin, X.L.; Wang, L.; Yao, J.C. Inertial splitting method for maximal monotone mappings. J. Nonlinear Convex Anal. 2020, 21, 2325–2333. [Google Scholar]
- Wei, L.; Agarwal, R.P. A new iterative algorithm for the sum of infinite m-accretive mappings and infinite μi-inversely strongly accretive mappings and its applications to integro-differentail systems. Fixed Point Theory Appl. 2016, 2016, 1–22. [Google Scholar]
- Ceng, L.C.; Ansari, Q.H.; Schaible, S. Hybrid viscosity approximation method for zeros of m-accretive operators in Banach space. Numer. Funct. Anal. Optim. 2012, 33, 142–165. [Google Scholar] [CrossRef]
- Wei, L.; Duan, L.L.; Agarwal, R.P.; Chen, R.; Zheng, Y.Q. Mordified forward-backward splitting midpoint method with superposition perturbations for sum of two kind of infinite accretive mappings and its applications. J. Inequal. Appl. 2017, 2017, 1–22. [Google Scholar] [CrossRef]
- Wei, L.; Shang, Y.Z.; Agarwal, R.P. New inertial forward-backward mid-point methods for sum of infinitely many accretive mappings, variational inequaties, and applications. Mathematics 2019, 7, 466. [Google Scholar] [CrossRef]
- Takahashi, W. Nonlinear Functional Analysis. Fixed Point Theory and Its Applications; Yokohama Publishers: Yokohama, Japan, 2000. [Google Scholar]
- Agarwal, R.P.; O’Regan, D.; Sahu, D.R. Fixed Point Theory for Lipschtz-Type Mappings with Applications; Springer: New York, NY, USA, 2009. [Google Scholar]
- Bruck, R.E. Properties of fixed-point sets of nonexpansive mappings in Banach spaces. Trans. Am. Math. Soc. 1973, 179, 251–262. [Google Scholar] [CrossRef]
- Mosco, U. Convergence of convex sets and of solutions of variational inequalities. Adv. Math. 1969, 3, 510–585. [Google Scholar] [CrossRef]
- Tsukada, M. Convergence of best approximations in a smooth Banach space. J. Approx. Theory 1984, 40, 301–309. [Google Scholar] [CrossRef]
- Xu, H.K. Inequalities in Banach space with applications. Nonlinear Anal. 1991, 16, 1127–1138. [Google Scholar] [CrossRef]
- Ceng, L.C.; Ansari, Q.H.; Yao, J.C. Mann-type steepest descent and modified hybrid steepest-descent methods for variational inequalities in Banach spaces. Numer. Funct. Anal. Optim. 2008, 29, 747–756. [Google Scholar] [CrossRef]
- Xu, H.K. Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 2002, 66, 240–256. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 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 (https://creativecommons.org/licenses/by/4.0/).