Abstract
The main aim of this research is to introduce and investigate an inertial Tseng iterative method to approximate a common solution for the variational inequality problem for -inverse strongly monotone mapping and monotone inclusion problem in real Hilbert spaces. We establish a strong convergence theorem for our suggested iterative method to approximate a common solution for our proposed problems under some certain mild conditions. Furthermore, we deduce a consequence from the main convergence result. Finally, a numerical experiment is presented to demonstrate the effectiveness of the iterative method. The method and methodology described in this paper extend and unify previously published findings in this field.
Keywords:
variational inequality problem; monotone inclusion problem; strong convergence; tseng iterative method MSC:
47H10; 47J22; 47J25; 65K15
1. Introduction
Let be a real Hibert space equipped with the inner product and the induced norm and let be a nonempty, closed, and convex subset of .
In 1966, Hartman and Stampacchia [1] proposed and studied the variational inequality problem (VIP), which is described as follows:
where is a nonlinear mapping. The solution set of VIP (1) is represented by Variational inequality is a useful tool in many domains including economics, engineering, mathematical programming, transportation, and others (see, for example, [2,3,4,5,6,7,8,9]). Many numerical approaches for solving variational inequalities and associated optimization problems have been developed; see [10,11,12,13,14,15] and references therein.
On the other hand, the monotone inclusion problem (MIP), which is described as follows:
where and are singlevalued and multivalued mappings, respectively. The solution set of MIP (2) is represented by .
This problem has received significant attention because it is at the core of many mathematical problems, including convex programming, variational inequalities, split feasibility problem, and minimization problems (see [16,17,18,19]), which have applications in machine learning, image processing, and linear inverse problems. Due to the importance and interest of the problem, many researchers have developed iterative methods for solving (2) (see [16,20,21,22]).
In 1979, Lions and Mercier [23] proposed and studied the forward–backward splitting method. It is described by the following iterative scheme:
where denotes the identity operator and . Operators and are referred to as forward and backward operators, respectively. The forward–backward splitting method has recently been investigated and extended by a number of authors (see [20,24,25,26,27]).
In 1964, Polyak [28] introduced the inertial extrapolation process as a useful tool for speeding up the convergence rate of iterative methods. This method is well known as the heavy-ball method. In recent years, many academicians have extensively used this beneficial concept to combine their algorithms with an inertial term in order to accelerate the speed of convergence (see [29,30]).
Alvarez and Attouch [29] introduced and constructed the heavy-ball method with the proximal point algorithm to solve a problem of maximal monotone operator. It is defined as follows:
where and is nondecreasing with They established that the sequence induced by (4) converges weakly to a zero of the monotone operator .
There are numerous approaches for solving the monotone inclusion problem by using an algorithm combined with the heavy-ball idea (see [26,31]).
In 2000, Tseng [22] proposed and studied the following iterative method, known as the Tseng splitting method, which is defined as follows:
Tseng established that the sequence induced by (5) converges weakly to a point of the solution set under some acceptable assumptions.
In 2021, Padcharoen et al. [32] developed and analyzed the following iterative method, known as the inertial Tseng method, for solving monotone inclusion problem, which is defined as follows:
They established that the sequence induced by (6) converges weakly to a point of the solution set under some certain assumptions.
In 2021, Tan and Cho [33] introduced and investigated the following iterative method, known as the inertial viscosity-type Tseng method, for solving monotone inclusion problem, which is defined as follows:
where is a -contraction with constant , is -Lipschitz continuous and monotone, and is a multivalued maximal monotone mapping. They established that the sequence induced by (7) converges strongly to a point of the solution set under some mild conditions.
2. Preliminaries
In this section, we review some fundamental definitions, results, and lemmas that will be applied in the subsequent sections. We denote the symbols ⇀ and → for weak and strong convergences, respectively.
A mapping is said to be
- (i)
- monotone if
- (ii)
- nonexpansive if
- (iii)
- firmly nonexpansive if
- (iv)
- -strongly monotone if there exists such that
- (v)
- -inverse strongly monotone if there exists such that
- (vi)
- -Lipschitz continuous with such that
A mapping is said to be metric projection from onto if for every point , there exists a unique nearest point in denoted by such that
It is well known that is nonexpansive and satisfies
Furthermore, is characterized by the fact and
This implies that
A multivalued mapping is said to be monotone, if for all and such that
A monotone mapping is at the maximum if , the graph of defined as is not properly contained in the graph of any other monotone mapping.
Remark 1.
It is well known that a monotone mapping is maximal if and only if for for each implies that
Let be a multivalued maximal monotone mapping. Then, the resolvent operator associated with is defined by
where denotes the identity operator. We notice that the resolvent operator is single-valued, nonexpansive, and firmly nonexpansive (see [34]).
Let be a monotone mapping and let be the normal cone to at , which is defined by . Define
Then, is maximal monotone and iff for more details, see [35,36,37].
Lemma 1
([38]). Let be a real Hilbert space. The following properties hold:
- (i)
- (ii)
- (iii)
Lemma 2
([39]). Let be a real Hilbert space. Let be a γ-inverse strongly monotone and be a maximal monontone mapping. Then, the following relation hold:
Lemma 3
([40]). Let be a sequence of non-negative real numbers such that
where and is a sequence in satisfy the following conditions:
- (i)
- (ii)
- ;
- (iii)
- ), .
Then, .
Lemma 4
([41]). Let be a sequence of real numbers that does not decrease at infinity in the sense that a subsequence of exists such that Additionally, consider the sequence of integers defined by
Then, is a non-decreasing sequence that verifies and for all ,
3. Main Result
In this section, we prove a strong convergence theorem based on the inertial Tseng splitting iterative method to compute a common solution of the variational inequality problem (1) and monotone inclusion problem (2).
Theorem 1.
Let be a real Hilbert space and be a nonempty, closed and convex subset of . Let be a multivalued maximal monotone mapping, be monotone and -Lipschitz continuous and be a γ-inverse strongly monotone mapping. Let be τ-Lipschitz continuous with such that For given let the sequences , , , , and be generated as follows:
where
where are two sequences in (0,1), and . Moreover, let the following conditions hold:
- (i)
- and
- (ii)
- (iii)
- and
Then, the sequence converges strongly to an element , where
We also need the following lemma to prove Theorem 1.
Lemma 5
Proof of Theorem 1.
Let ; by Lemma 5, we have
and
From (13), it can be written as
Moreover, we observe that
and
and
Consider
Thus, sequence generated by (9) is bounded and so are the sequences , , , and .
Next, we observe that
It follows that
and
Then, by combining (20) with (21), we have
From (13) and (17) and (22), we have
Consider
It follows that
Therefore, we obtain
Moreover, by using (25), we obtain
Now, we suppose two possible cases to show that
Case I: Assume that the sequence is non-increasing; then, there exists such that for every . Hence, converges.
Since and we obtain from (26) that
Thus, from (14), we have
If we consider
from (28) and (29), we obtain
Now, from (9), we have
It follows from (22) that
which implies
Using conditions (i) and (iii) and fact that exists, we have
From Lemma 1 (i), we compute
It follows from (22) and (35) that
which implies
As exists, then using conditions (i), (iii), and (34), we have
Using (iii), we observe that
We can write
This implies that
Since is bounded, take a subsequence of such that ⇀ . Then, we have
Using the fact that , , and we obtain
Therefore . Next we show that
Since and , there exist subsequences and of and , respectively, such that and . Define the mapping as follows:
where is the normal cone to at . In this case, mapping is maximal monotone and mapping iff . Let , we have and, hence, . By the definition of , we have . On the other hand, since and , we have
This implies that
Since and , using the monotonicity of , we have
Since is continuous, therefore, on taking limit , we have Since is maximal monotone, we have and, hence, We obtain
By Lemma 3 and using (27) and (41) and condition of paprameters, we can claim that the sequence strongly converges to .
Case II: Assume that the sequence is increasing. Let be a mapping for all values (where is large enough). This is defined by
Then, and for all . By using (26) and the conditions of the parameters for each , we have
Using 3.1 (i), we conclude that
From Lemma 4, we obtain
Therefore where
4. Consequences
In this section, we deduce a special case from our main convergence theorem.
Setting in Theorem 1, we have the following result.
Corollary 1.
Let be a real Hilbert space and let be a nonempty, closed, and convex subset of . Let be a multivalued maximal monotone mapping, be monotone and -Lipschitz continuous and be a γ-inverse strongly monotone mapping. Let be τ-Lipschitz continuous with such that For a given let the sequences , , , and be generated as follows:
where
where is a sequence in (0,1), and . Moreover, let the following conditions hold:
- (i)
- and
- (ii)
Then, the sequence converges strongly to an element , where
5. Numerical Experiment
In this section, we present a numerical result to demonstrate the applicability of our main result.
Let be the set of all real numbers with the inner product represented by , and the equipped with usual norm . Let be defined by and let be defined by Let the mapping be defined by let the mapping be defined by
It is easy to see that is - Lipschitz continuous and monotone with , is a -Lipschitz continuous with , and is -inverse strongly monotone mapping with . Let us choose , and . Furthermore, we observe that and ; hence, .
From Table 1 and Figure 1, it can be very well visualized that the sequence of iteration converges weakly to 0.
Table 1.
Numerical results for different initial values and .
Figure 1.
Convergence of sequence .
6. Conclusions
In this paper, we developd and analyzed an inertial Tseng iterative method to find a common solution for the variational inequality problem and monotone inclusion problem with the help of the inertial Tseng method in the setting of real Hilbert spaces. Furthermore, we show that the sequences induced by the proposed iterative method converge strongly to an element of common solution of these problems. We also discuss a special cases deduced from our main convergence result. Finally, we present a numerical experiment to justify the main convergence theorem.
Author Contributions
All the authors contributed equally and significantly in writing this article. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Acknowledgments
All the authors are grateful to the anonymous referees for their excellent suggestions, which greatly improved the presentation of the paper.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Hartman, P.; Stampacchia, G. On some non-linear elliptic differential-functional equations. Acta Math. 1966, 115, 271–310. [Google Scholar] [CrossRef]
- Facchinei, F.; Pang, J.S. Finite-Dimensional Variational Inequalities and Complementarity Problems; Springer: New York, NY, USA, 2003. [Google Scholar]
- Jolaoso, L.O.; Oyewole, K.O.; Okeke, C.C.; Mewomo, O.T. A unified algorithm for solving split generalized mixed equilibrium problem, and for finding fixed point of nonspreading mapping in Hilbert spaces. Demonstr. Math. 2018, 51, 211–232. [Google Scholar] [CrossRef]
- Jolaoso, L.O.; Taiwo, A.; Alakoya, T.O.; Mewomo, O.T. A strong convergence theorem for solving pseudo-monotone variational inequalities using projection methods. J. Optim. Theory Appl. 2020, 185, 744–766. [Google Scholar] [CrossRef]
- Kinderlehrer, D.; Stampacchia, G. An Introduction to Variational Inequalities and Their Applications; SIAM: New York, NY, USA, 2000. [Google Scholar]
- Konnov, I. Combined Relaxation Methods for Variational Inequalities; Springer Science & Business Media: Berlin, Germany, 2001; Volume 495. [Google Scholar]
- Mewomo, O.; Ogbuisi, F. Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces. Quaest. Math. 2018, 41, 129–148. [Google Scholar] [CrossRef]
- Ogbuisi, F.; Mewomo, O. Iterative solution of split variational inclusion problem in a real Banach spaces. Afr. Mat. 2017, 28, 295–309. [Google Scholar] [CrossRef]
- Ogbuisi, F.; Mewomo, O. Convergence analysis of common solution of certain nonlinear problems. Fixed Point Theory 2018, 19, 335–358. [Google Scholar] [CrossRef]
- Censor, Y.; Gibali, A.; Reich, S. Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space. Optim. Methods Softw. 2011, 26, 827–845. [Google Scholar] [CrossRef]
- Censor, Y.; Gibali, A.; Reich, S. The subgradient extragradient method for solving variational inequalities in Hilbert space. J. Optim. Theory Appl. 2011, 148, 318–335. [Google Scholar] [CrossRef]
- Censor, Y.; Gibali, A.; Reich, S. Algorithms for the split variational inequality problem. Numer. Algorithms 2012, 59, 301–323. [Google Scholar] [CrossRef]
- Cholamjiak, P.; Suantai, S. Iterative methods for solving equilibrium problems, variational inequalities and fixed points of nonexpansive semigroups. J. Glob. Optim. 2013, 57, 1277–1297. [Google Scholar] [CrossRef]
- Liu, L.; Cho, S.Y.; Yao, J.C. Convergence analysis of an inertial Tseng’s extragradient algorithm for solving pseudomonotone variational inequalities and applications. J. Nonlinear Var. Anal. 2021, 5, 627–644. [Google Scholar]
- Tian, M.; Xu, G. Inertial modified Tseng’s extragradient algorithms for solving monotone variational inequalities and fixed point problems. J. Nonlinear Funct. Anal. 2020, 2020, 35. [Google Scholar]
- Combettes, P.L.; Wajs, V.R. Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 2005, 4, 1168–1200. [Google Scholar] [CrossRef]
- Daubechies, I.; Defrise, M.; De Mol, C. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. A J. Issued Courant Inst. Math. Sci. 2004, 57, 1413–1457. [Google Scholar] [CrossRef]
- Duchi, J.; Singer, Y. Efficient online and batch learning using forward backward splitting. J. Mach. Learn. Res. 2009, 10, 2899–2934. [Google Scholar]
- Raguet, H.; Fadili, J.; Peyré, G. A generalized forward-backward splitting. SIAM J. Imaging Sci. 2013, 6, 1199–1226. [Google Scholar] [CrossRef]
- Attouch, H.; Peypouquet, J.; Patrick, R. Backward–forward algorithms for structured monotone inclusions in Hilbert spaces. J. Math. Anal. Appl. 2018, 457, 1095–1117. [Google Scholar] [CrossRef]
- Huang, Y.; Dong, Y. New properties of forward–backward splitting and a practical proximal-descent algorithm. Appl. Math. Comput. 2014, 237, 60–68. [Google Scholar] [CrossRef]
- Tseng, P. A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control Optim. 2000, 38, 431–446. [Google Scholar] [CrossRef]
- Lions, P.L.; Mercier, B. Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 1979, 16, 964–979. [Google Scholar] [CrossRef]
- Boț, R.I.; Csetnek, E.R.; László, S.C. An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions. EURO J. Comput. Optim. 2016, 4, 3–25. [Google Scholar] [CrossRef]
- Cholamjiak, P.; Shehu, Y. Inertial forward-backward splitting method in Banach spaces with application to compressed sensing. Appl. Math. 2019, 64, 409–435. [Google Scholar] [CrossRef]
- Lorenz, D.A.; Pock, T. An inertial forward-backward algorithm for monotone inclusions. J. Math. Imaging Vis. 2015, 51, 311–325. [Google Scholar] [CrossRef] [Green Version]
- Moudafi, A.; Shehu, Y. Convergence of the forward–backward method for split null-point problems beyond coerciveness. J. Nonlinear. Convex. Anal. 2019, 20, 1659–1672. [Google Scholar]
- Polyak, B.T. Some methods of speeding up the convergence of iteration methods. Ussr Comput. Math. 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]
- Husain, S.; Khan, F.A.; Furkan, M.; Khairoowala, M.U.; Eljaneid, N.H. Inertial Projection Algorithm for Solving Split Best Proximity Point and Mixed Equilibrium Problems in Hilbert Spaces. Axioms 2022, 11, 321. [Google Scholar] [CrossRef]
- Moudafi, A.; Oliny, M. Convergence of a splitting inertial proximal method for monotone operators. J. Comput. Appl. Math. 2003, 155, 447–454. [Google Scholar] [CrossRef]
- Padcharoen, A.; Kitkuan, D.; Kumam, W.; Kumam, P. Tseng methods with inertial for solving inclusion problems and application to image deblurring and image recovery problems. Comput. Math. Methods 2021, 3, e1088. [Google Scholar] [CrossRef]
- Tan, B.; Cho, S.Y. Strong convergence of inertial forward–backward methods for solving monotone inclusions. Appl. Anal. 2021, 1–29. [Google Scholar] [CrossRef]
- Brezis, H. Operateurs maximaux monotones, North-Holland. Math. Stud. 1973, 5, 1–183. [Google Scholar]
- Iiduka, H.; Takahashi, W. Strong convergence theorems for nonexpansive mappings and inverse-strongly monotone mappings. Nonlinear Anal. Theory Methods Appl. 2005, 61, 341–350. [Google Scholar] [CrossRef]
- Rockafellar, R.T. On the maximality of sums of nonlinear monotone operators. Trans. Am. Math. Soc. 1970, 149, 75–88. [Google Scholar] [CrossRef]
- Rockafellar, R.T. Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 1976, 14, 877–898. [Google Scholar] [CrossRef]
- Bauschke, H.H.; Combettes, P.L. Convex Analysis and Monotone Operator Theory in Hilbert Spaces; Springer: New York, NY, USA, 2011; Volume 408. [Google Scholar]
- López, G.; Martín-Márquez, V.; Wang, F.; Xu, H.K. Forward-backward splitting methods for accretive operators in Banach spaces. Abstr. Appl. Anal. 2012, 2012, 109236. [Google Scholar] [CrossRef] [Green Version]
- Xu, H.K. Viscosity approximation methods for nonexpansive mappings. J. Math. Anal. Appl. 2004, 298, 279–291. [Google Scholar] [CrossRef]
- Mainge, P.E. Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Anal. 2008, 16, 899–912. [Google Scholar] [CrossRef]
- Gibali, A.; Thong, D.V. Tseng type methods for solving inclusion problems and its applications. Calcolo 2018, 55, 1–22. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 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/).