Content area
The system of extended ordered XOR-inclusion problems (in short, SEOXORIP) involving generalized Cayley and Yosida operators is introduced and studied in this paper. The solution is obtained in a real ordered Banach space using a fixed-point approach. First, we develop the fixed-point lemma for the solution of SEOXORIP. By using the fixed-point lemma, we develop a three-step iterative scheme for obtaining the approximate solution of SEOXORIP. Under the Lipschitz continuous assumptions of the cost mappings, the strong convergence of the scheme is demonstrated. Lastly, we provide a numerical example with a convergence graph generated using MATLAB 2018a to verify the convergence of the sequence generated by the proposed scheme.
Full text
1. Introduction
It is widely acknowledged that convex minimization problems, variational inequalities, equilibrium challenges, and feasibility dilemmas represent particular instances of variational inclusion problems. In the context of a single-valued mapping and a multivalued (potentially nonlinear) operator , the objective is to determine such that
(1)
which is designated as a variational inclusion problem, exhibiting applications in signal processing [1], image processing [2], machine learning [3], and applications to multiple sets split feasibility problems [4].The inability of projection methods to effectively address variational inclusion problems necessitated the emergence of resolvent operator methods, which have proven to be efficient in solving these problems. In their seminal works, Fang and Huang [5,6] put forth the concepts of H-monotone operators and H-accretive mappings, and by establishing the resolvent operators that correspond to these concepts, they investigated a specific category of variational inclusions within the context of Hilbert and Banach spaces. Following this, Xia and Huang [7] proposed the notion of general H-monotone operators as an extension of J-proximal mapping [8] and articulated a proximal mapping that is associated with general H-monotone operators, which diverges from the resolvent operator linked with the H-accretive mapping [6].
In 1972, a multitude of solutions pertaining to nonlinear equations were presented and analyzed by Amann [9]. In the recent past, fixed-point theory alongside its applications has undergone rigorous examination within the context of real ordered Banach spaces. Consequently, it is of paramount significance and a natural progression for generalized nonlinear ordered variational inequalities (ordered equations) to be meticulously investigated and deliberated. In 2008, Li [10] delineated the framework of generalized nonlinear ordered variational inequalities and proposed a computational algorithm aimed at approximating solutions for a specific class of generalized nonlinear ordered variational inequalities (ordered equations) within real ordered Banach spaces. Over the past two to three years, various forms of ordered variational inequalities and ordered inclusion problems have been extensively scrutinized, as evidenced in works such as [11,12,13] and the associated references therein.
On the contrary, Glowinski, in the year 1989 [14], and Noor, between the years 2000 and 2001 [15,16], formulated a three-step iterative algorithm aimed at addressing various categories of variational inequalities through the application of the Lagrangian multiplier and auxiliary principle methodologies. Consequently, it can be inferred that three-step iterative algorithms occupy a pivotal and consequential role in solutions to diverse challenges encountered in both pure and applied scientific disciplines. Glowinski et al. [14] and Noor [17] demonstrated that the three-step schemes yielded superior numerical outcomes in comparison to the two-step and one-step approximation iterations. In the year 2018, Iqbal et al. [18] introduced a three-step iterative framework for generalized mixed ordered quasi-variational inclusion that incorporates the XOR operator, while more recently, Ali et al. [19] examined the convergence and stability of the three-step iterative algorithm applied to the Extended Cayley–Yosida Inclusion Problem within the context of 2-Uniformly Smooth Banach Spaces.
It is imperative to acknowledge that the selection of the governing sequences can significantly influence the efficacy of iterative algorithms.
Motivated by the preceding research while adhering to Remark 1, this manuscript presents a framework for extended ordered XOR-inclusion problems that incorporate generalized Cayley and Yosida operators. The solution is attained within a real Banach space utilizing a fixed-point methodology. Initially, we established the fixed-point lemma pertinent to the solutions of the proposed system. By applying the fixed-point lemma, we formulated a three-step iterative scheme aimed at deriving an approximate solution for SEOXORIP. Under the assumptions of Lipschitz continuity pertaining to the cost mappings, we elucidate the strong convergence of the iterative scheme. Finally, we furnish a numerical example accompanied by a convergence graph generated through MATLAB 2018a to substantiate the convergence of the sequence produced by the proposed scheme.
2. Prerequisites and Formulation of SEOXORIP
Throughout this manuscript, we consider to be a real ordered Banach space equipped with the norm and the inner product , the metric generated by the norm , (correspondingly, ) representing the nonempty collection of (closed and bounded) subsets of , and the Hausdorff metric on , which is defined as follows:
where and .A cone is a convex and closed subset of that satisfies, for any and scalar , . is called pointed cone if For any , we define an ordering such that . If either or , then x and y are called comparable elements, and this is denoted by . The real Banach space equipped with ordering is said to be an ordered Banach space.
Let and denote the least upper bound and greatest lower bound of the set , respectively, for all Suppose that and for the set exist; then, we define binary operations:
The operations ⊕, and ⊙ are called OR, AND, XOR, and XNOR operations, respectively. For more details, refer to [20].
([11,13]). Let ⊕ be an XOR operation and ⊙ be an XNOR operation. Then, the following holds:
If then If then if and only if If , and w are comparable to each other, then If , and w are comparable to each other, then ; If then
([11,13]). A single-valued mapping is called
A comparison mapping if, for every and , then and A strong comparison mapping if f is a comparison mapping and if and only if for any A -ordered compression mapping if f is a comparison mapping and
Let be strong comparison single-valued mappings. Then, the mapping is called
A -ordered compression mapping associated with f in the first component if there exists a constant such that
A -ordered compression mapping associated with g in the second component if there exists a constant such that
([21]). Let be a metric space and be a Hausdorff metric on . Then, the multivalued map is called a multivalued Lipschitz-type mapping with respect to if there is a constant such that
where be single-valued mapping.([22]). Let be single-valued mapping, and be a multivalued mappings. Then, is said to be α-strongly accretive with respect to h if there is a constant such that
([22]). Let be a single-valued mapping, be a multivalued mapping, and be α-strongly accretive with respect to h. Then, the mapping is single-valued for and
([22]). Let be a single-valued mapping, be a multivalued mapping, and be α-strongly accretive with respect to h. Then, is said to be generalized α-maximal monotone with respect to h if
Let be a single-valued mapping and be a multivalued mapping. Let be generalized α-strongly accretive with respect to h. Then, the generalized proximal-point mapping associated with h and is defined by
(2)
([11,22]). Let be a single-valued mapping and be a multivalued mapping. Let be generalized α-maximal monotone with respect to h. Then, the generalized proximal-point mapping is -Lipschitz continuous. That is,
where([19]). The generalized Yosida approximation operator associated with the proximal-point mapping is a single-valued mapping; that is, is defined by
(3)
([19]). The generalized Cayley operator associated with the proximal-point mapping is a single-valued mapping; that is, is defined by
(4)
It is well known that the generalized Yosida approximation operator is Lipschitz-type continuous with constant Similarly, the generalized Cayley operator is Lipschitz-type continuous with constant
SEOXORIP and the Existence of Its Solution
We assume that, for , . Let and be single-valued mappings. Suppose that is a generalized -strongly accretive multivalued mapping with respect to , and is a closed and bounded multivalued mapping. Then, our interest is in finding and such that
(5)
holds, for some This system is called an extended nonlinear system of ordered XOR-inclusion problems involving generalized Cayley–Yosida operators (in short, SEOXORIP).Moreover, to highlight the level of generalization of our problem, we present several special cases below.
Special Cases: If we define and , then SEOXORIP (5) becomes a system for finding such that (6)
Let . If we define and , then for system (5) reduces to the following System of Generalized Variational Inclusions (SGVI), that is, a problem where must be found, such that
(7)
hold, where and are the zeros of and , respectively. System (7) was studied by Kazmi et al. [22].By using the proximal-point mapping, we can characterize the solution of system (5) in terms of fixed-point equations.
SEOXORIP (5) has the solution , i.e., and if and only if the following equations hold:
(8)
where are non-negative real numbers.The proof follows directly from Definition 6 of proximal-point mapping.
Now, we have the following theorem for the existence of the solution to system (5). □
Let , . Let be , , and strongly ordered comparison mappings. Assume that is a -ordered compression mapping associated with in the first component and -ordered compression mapping associated with in the second component. Let be generalized -strongly accretive with respect to and be a closed and bounded multivalued mapping. Suppose , , and are Lipschitz continuous with constants , , and , respectively.
Additionally, let , , , and , and for all constants , the following relations hold:
(9)
whereThen, SEOXORIP (5) admits a solution
We define the mapping by
where the mappings are defined as Let such that , and by applying Proposition 3, we have(10)
By applying Proposition 1 and the ordered compressionness of and , we have(11)
Since is a -ordered compression mapping in the first component with respect to and a -ordered compression mapping in the second component with respect to , we have(12)
Inserting (11) and (12) into (10) and applying Proposition 1, we get(13)
Continuing in similar fashion, let such that and ; applying Proposition 3, we have(14)
By applying Proposition 1 and the ordered compressionness of and , we have(15)
Since is a -ordered compression mapping associated with in the first component and a -ordered compression mapping associated with in the second component, we have(16)
Inserting (15) and (16) into (14) and applying Proposition 1, we get(17)
Based on (13) and (17), we have that is,(18)
whereThe norm is defined as
(19)
Clearly, the structure forms a Banach space with respect to the norm (19). Thus, the definition of the mapping , (18) and (19), implies that(20)
From (9), we conclude that . Therefore, there exists a unique fixed point of the mapping . That is, This leads to(21)
Hence, Lemma (1) ensures that is a solution of system (5). □
3. Three-Step Iterative Scheme and Its Convergence
In this section, leveraging Lemma 1, we formulate a three-step iterative algorithm aimed at determining the approximate solution for the newly established system of ordered XOR-inclusion problems involving Cayley and Yosida operators (Algorithm 1). The convergence properties of the sequence produced by the algorithm are demonstrated under certain appropriate assumptions.
| Algorithm 1: Three-Step Iterative Algorithm for the Approximate Solution of SEOXORIP |
| Let , ; let and be single-valued mappings. Let be a -Lipschitz continuous mapping with constants and let be a generalized -strongly accretive mapping with respect to . Then, (22) for where is a constant and , and are real sequences in (0,1) such that Step II: Choose such that(23) where is the Hausdorff metric on . |
Algorithm 1 becomes a two-step iterative algorithm (Ishikawa-type) if for all , and it reduces to a one-step iterative scheme (Mann-type) when choosing for all We also observe that if we define the appropriate operators for Algorithm 1, we can easily acquire many more methods that have been studied by several authors for addressing ordered variational inclusions, see, e.g., [24,25,26].
The sequence as if and are sequences in such that
and ; hold.
Let all the mappings and conditions be the same as in Theorem 1, except for condition (9). Additionally, if
(24)
(25)
andhold, then the sequences generated by Algorithm 1 converge strongly to the solution of system (5).
Theorem 1 guarantees that System (5) admits the solution . Let us assume that is a unique solution of SEOXORIP (5). Then, we have
(26)
From (22), (26), and Proposition 3, we obtain In similar way to (10), using (24), we have(27)
From Definitions 7 and 8 and (12), we have(28)
Since , according to Nadler [27], ∃ such that(29)
Using the -Lipschitz continuity of , we obtain(30)
Using (28), (30), and Proposition 3 in (27), we get(31)
By of Proposition 1, we have(32)
Let(33)
Similarly, we calculate(34)
In a similar way, by using the definition of in Algorithm 1, we obtain(35)
Using (34) and (35) in (33), we have(36)
After simplification and by Proposition 1, we obtain(37)
By applying the same logic as above, we have(38)
Continuing in a similar way, we have(39)
From (37)–(39), we have(40)
where Let . From (25) and by algebra of convergence of sequences and , we may say that as , where . Condition (25) implies that , so for sufficiently large n.Let . Then, (40) can be written as
Clearly, for With the help of Lemma 2, we may claim that Hence, converge strongly to the solution of system (5). □
A numerical example is provided with a convergence graph.
4. Numerical Example
Let , , and such that
(41)
for some .Let the mappings , , be defined by
andSuppose that the mapping is defined as
Now, we define the associated resolvent operator,(42)
the Yosida approximation operator,(43)
and the Cayley operator,(44)
Let us choose the controlling sequences , and . Clearly, , , , and satisfy the conditions of Algorithm 1.The sequences for the approximate solution of (41) are obtained by using Algorithm 1 in the following way:
(45)
(46)
and(47)
Also, it is verified that all conditions of Theorem 2 are satisfied. Clearly, for the sequence converges strongly to the solution of system (41). In this regard the convergence graph (Figure 1) and computational table (Table 1) are shown below. Also, the convergence of each sequence individually involved in Algorithm 1 is shown in Figure 2.We select identical operators to those in the above numerical illustration and compare our innovative three-step iterative Algorithm 1 against the two-step iterative algorithm (Ishikawa-style) and the one-step iterative algorithm (Mann-style). By setting , we derive the sequences and as detailed below:
(48)
(49)
Moreover, by taking for all , we may approximate by using the Mann-style iterative scheme as follows:(50)
The iterative methods that we are employing will stop their operations once the stopping criterion has been satisfactorily met. In the accompanying Table 2 and the illustrative Figure 3, we present a comprehensive comparison showcasing the performance of our innovative three-step Algorithm 1, alongside the well-established Ishikawa-type Equations (48) and (49), in conjunction with the Mann-type Algorithm (50), all of which are initiated with the chosen starting point of .The numerical findings that are meticulously detailed in Table 2 and the graphical representation provided in Figure 3 strongly suggest that our newly proposed three-step Algorithm 1 demonstrates impressive performance and appears to possess a significant competitive edge over the other methods. Based on this analysis, we can confidently assert that our algorithm exhibits remarkable speed and efficiency, typically requiring an average of about 10 to 12 iterations to achieve convergence successfully.
5. Conclusions
In this manuscript, the framework of extended ordered XOR-inclusion problems incorporating Cayley and Yosida operators is presented and examined within the context of real ordered Banach spaces, which encompasses a broader scope than the problems addressed in [11,19,28]. We investigated the existence of solutions to SEOXORIP by utilizing proximal-point mappings under specific conditions deemed appropriate. A three-step iterative methodology is proposed for deriving approximate solutions to SEOXORIP, and an analysis of the convergence of the proposed methodology was conducted. Ultimately, we provided a numerical example accompanied by a convergence graph generated using MATLAB 2018a to substantiate the convergence of the sequence produced by the proposed methodology.
Conceptualization, D.F., I.A., and F.A.K.; methodology, I.A., N.H.E.E., and E.A.; formal analysis, M.S.A.; investigation, N.H.E.E.; resources, D.F., I.A., and F.A.K.; writing—original draft, I.A., N.H.E.E., and F.A.K.; writing—review and editing, D.F., E.A., and M.S.A.; supervision, F.A.K.; funding acquisition, D.F., E.A., and M.S.A. All authors have read and agreed to the published version of the manuscript.
The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding authors.
The authors are grateful to the anonymous reviewers for their valuable remarks which improved the results and presentation of this paper.
The authors declare no conflicts of interest.
Footnotes
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Figure 1 Convergence of
Figure 2 Convergence of
Figure 3 Convergence of
The computational table of
| No. of | For | For | For |
|---|---|---|---|
| Iterations | | | |
| n = 1 | (−1,2) | (3,−2) | (4,−1) |
| n = 2 | (−0.49930, 0.81207) | (0.23862, 0.24273) | (−0.72659, 2.10466) |
| n = 3 | (−0.45165, 0.71122) | (−0.44464,1.89461) | (−0.43555, 0.89865) |
| n = 4 | (−0.46018, 0.80844) | (−0.33075, 0.90799) | (−0.43376, 0.89865) |
| n = 5 | (−0.45581, 0.80425) | (−0.33841, 0.75610) | (−0.46637, 0.82427) |
| n = 10 | (−0.44173, 0.76545) | (−0.36189, 0.69389) | (−0.4845, 0.74925) |
| n = 15 | (−0.43366, 0.73856) | (−0.36339, 0.63498) | (−0.48451, 0.71074) |
| n = 20 | (−0.42794, 0.71821) | (−0.36241, 0.60042) | (−0.48211, 0.68513) |
| n = 25 | (−0.42341, 0.70210) | (−0.36087, 0.57680) | (−0.47936, 0.66615) |
| n = 30 | (−0.41972, 0.68884) | (−0.35921, 0.55919) | (−0.47668, 0.65118) |
| n = 35 | (−0.41659, 0.67762) | (−0.35758, 0.54531) | (−0.47417, 0.63887) |
| n = 40 | (−0.41389, 0.66791) | (−0.35604, 0.53394) | (−0.47186, 0.62845) |
| n = 45 | (−0.41149, 0.65938) | (−0.35458, 0.52436) | (−0.46972, 0.61943) |
| n = 55 | (−0.40742, 0.64494) | (−0.35194, 0.50891) | (−0.46591 0.60444) |
| n = 70 | (−0.40252, 0.62779) | (−0.34853, 0.49157) | (−0.46113, 0.58701) |
| n = 80 | (−0.39981, 0.61841) | (−0.34656, 0.48248) | (−0.45835 0.57760) |
| n = 90 | (−0.39742, 0.61020) | (−0.34479, 0.47473) | (−0.45588, 0.56946) |
| n = 100 | (−0.39523, 0.60290) | (−0.34318, 0.46796) | (−0.45365, 0.56228) |
The values of
| No. ofIterations | Three-Step Iterative Algorithm | Two-Step Iterative Algorithm | One Step Iterative Algorithm |
|---|---|---|---|
| n = 1 | (−0.5,1) | (−0.5,1) | (−0.5,1) |
| n = 2 | (0.12570, −0.25747) | (0.02153, −0.08605) | (0.03702, −0.37147) |
| n = 3 | (0.20262, −0.30925) | (0.11337, −0.14096) | (0.18311, −0.41916) |
| n = 4 | (0.16102, −0.13137) | (0.11288, −0.0982) | (0.22754, −0.34455) |
| n = 5 | (0.11547, −0.05666) | (0.09339, −0.06932) | (0.2329, −0.27319) |
| n = 10 | (0.01631, 0.00114) | (0.02223, −0.01653) | (0.15164, −0.11691) |
| n = 15 | (0.00225, 0.00301) | (0.00459, −0.00439) | (0.09413, −0.07328) |
| n = 20 | (0.00017, 0.00172) | (0.00071 −0.00100) | (0.06543, −0.05345) |
| n = 25 | (0, 0.00093) | (0.00013, −0.0001) | (0.04982, −0.04209) |
| n = 30 | (0, 0.00052) | (0, 0.00016) | (0.04026, −0.03471) |
| n = 35 | (0, 0.00029) | (0, 0.00013) | (0.03382, −0.02954) |
| n = 40 | (0, 0.00016) | (0, 0.00009) | (0.02918, −0.02571) |
| n = 45 | (0, 0.00009) | (0, 0.00006) | (0.02566, −0.02276) |
| n = 55 | (0, 0) | (0, 0.00003) | (0.02069, 0) |
| n = 70 | (0, 0) | (0, 0) | (0.01604, 0) |
| n = 80 | (0, 0) | (0, 0) | (0.01395, −0.01262) |
| n = 90 | (0, 0) | (0, 0) | (0.01234, −0.0112) |
| n = 100 | (0, 0) | (0, 0) | (0.01107, −0.01006) |
1. Adamu, A.; Abass, H.H.; Ibrahim, A.I.; Kilicman, A. An accelerated Halpern-type algorithm for solving variational inclusion problems with applications. Bangmod J. Math. Comput. Sci.; 2022; 8, pp. 37-55. [DOI: https://dx.doi.org/10.58715/bangmodjmcs.2022.8.4]
2. Adamu, A.; Deepho, J.; Ibrahim, A.H.; Abubakar, A.B. Approximation of zeros of sum of Monotone Mappings with Applications to Variational Inequalities Problems and image processing. Nonlinear Fun. Anal. Appl.; 2021; 262, pp. 411-432.
3. Taiwo, A.; Reich, S.; Agarwal, R.P. Tseng-Type Algorithms for Solving Variational Inequalities Over the Solution Sets of Split Variational Inclusion Problems with An Application to A Bilevel Optimization Problem. J. Appl. Numer. Optim.; 2024; 6, pp. 41-57.
4. Lin, L.-J.; Chen, Y.-D.; Chuang, C.-S. Solutions for a variational inclusion problem with applications to multiple sets split feasibility problems. Fixed Point Theory Appl.; 2013; 2013, 333. [DOI: https://dx.doi.org/10.1186/1687-1812-2013-333]
5. Fang, Y.-P.; Huang, N.-J. H-monotone operator and resolvent operator technique for variational inclusions. Appl. Math. Comput.; 2003; 145, pp. 795-803. [DOI: https://dx.doi.org/10.1016/S0096-3003(03)00275-3]
6. Fang, Y.-P.; Huang, N.-J. H-accretive operators and resolvent operator technique for solving variational inclusions in Banach spaces. Appl. Math. Lett.; 2004; 17, pp. 647-653. [DOI: https://dx.doi.org/10.1016/S0893-9659(04)90099-7]
7. Xia, F.-Q.; Huang, N.-J. Variational inclusions with a general H-monotone operator in Banach spaces. Comput. Math. Appl.; 2007; 54, pp. 24-30. [DOI: https://dx.doi.org/10.1016/j.camwa.2006.10.028]
8. Ding, X.P.; Xia, F.Q. A new class of completely generalized quasivariational inclusions in Banach spaces. J. Comput. Appl. Math.; 2002; 147, pp. 369-383. [DOI: https://dx.doi.org/10.1016/S0377-0427(02)00443-0]
9. Amann, H. On the number of solutions of nonlinear equations in ordered Banach spaces. J. Funct. Anal.; 1972; 11, pp. 346-384. [DOI: https://dx.doi.org/10.1016/0022-1236(72)90074-2]
10. Li, H.G. Approximation solution for general nonlinear ordered variational inequalities and ordered equations in ordered Banach space. Nonlinear Anal. Forum; 2008; 13, pp. 205-214.
11. Ali, I.; Ahmad, R.; Wen, C.F. Cayley Inclusion problem involving XOR-operation. Mathematics; 2019; 7, 302. [DOI: https://dx.doi.org/10.3390/math7030302]
12. Li, H.G.; Li, L.P.; Jin, M.M. A class of nonlinear mixed ordered ininclusion problems for ordered (αA,λ)-ANODM set-valued mappings with strong compression mapping. Fixed Point Theory Appl.; 2014; 2014, 79. [DOI: https://dx.doi.org/10.1186/1687-1812-2014-79]
13. Li, H.G. A nonlinear inclusion problem involving (α,λ)-NODM set-valued mappings in ordered Hilbert space. Appl. Math. Lett.; 2012; 25, pp. 1384-1388. [DOI: https://dx.doi.org/10.1016/j.aml.2011.12.007]
14. Glowinski, G.; Le Tallec, P. Augmented Lagrangian and Operator Splitting Methods in Nonlinear Mechanics; SIAM: Philadelphia, PA, USA, 1989.
15. Noor, M.A. New approximation schemes for general variational inequalities. J. Math. Anal. Appl.; 2000; 251, pp. 217-229. [DOI: https://dx.doi.org/10.1006/jmaa.2000.7042]
16. Noor, M.A. A predictor-corrector algorithm for general variational inequalities. Appl. Math. Lett.; 2001; 14, pp. 53-58. [DOI: https://dx.doi.org/10.1016/S0893-9659(00)00112-9]
17. Noor, M.A. Three-step iterative algorithms for multivaled quasi-variational inclusions. J. Math. Anal. Appl.; 2001; 255, pp. 589-604. [DOI: https://dx.doi.org/10.1006/jmaa.2000.7298]
18. Ahmad, I.; Rahaman, M.; Ahmad, R.; Ali, I. Convergence analysis and stability of perturbed three-step iterative algorithm for generalized mixed ordered quasi-variational inclusion involving XOR operator. Optimization; 2020; 69, pp. 821-845. [DOI: https://dx.doi.org/10.1080/02331934.2019.1652910]
19. Ali, I.; Wang, Y.; Ahmad, R. Convergence and Stability of a Three-Step Iterative Algorithm for the Extended Cayley–Yosida Inclusion Problem in 2-Uniformly Smooth Banach Spaces: Convergence and Stability Analysis. Mathematics; 2024; 12, 1977. [DOI: https://dx.doi.org/10.3390/math12131977]
20. Schaefer, H.H. Banach Lattices and Positive Operators; Springer: Berlin/Heidelberg, Germany, 1974.
21. Aubin, J.P.; Cellina, A. Differential Inclusions; Springer: Berlin, Germany, 1984.
22. Kazmi, K.R.; Khan, F.A.; Shahzad, M. A system of generalized variational inclusions involving generalized H(·,·)-accretive mapping in real q-uniformly smooth Banach spaces. Appl. Math. Comput.; 2011; 217, pp. 9679-9688. [DOI: https://dx.doi.org/10.1016/j.amc.2011.04.052]
23. Salahuddin,. System of Generalized Mixed Nonlinear Ordered Variational Inclusions. Numer. Algebra Control. Optim.; 2019; 9, pp. 445-460. [DOI: https://dx.doi.org/10.3934/naco.2019026]
24. Du, Y.H. Fixed points of increasing operators in ordered Banach spaces and applications. Appl. Anal.; 1990; 38, pp. 1-20. [DOI: https://dx.doi.org/10.1080/00036819008839957]
25. Ahmad, I.; Ahmad, R.; Iqbal, J. A resolvent approach for solving a set-valued variational inclusion problem using weak-RRD set-valued mapping. Korean J. Math.; 2016; 16, pp. 199-213. [DOI: https://dx.doi.org/10.11568/kjm.2016.24.2.199]
26. Osilike, M.O. Stability results for the Ishikawa fixed point iteration procedure. Ind. J. Pure Appl. Math.; 1995; 26, pp. 937-945.
27. Nadler, S.B., Jr. Multi-valued contraction mappings. Pac. J. Math.; 1969; 30, pp. 475-488. [DOI: https://dx.doi.org/10.2140/pjm.1969.30.475]
28. Arifuzzaman,; Irfan, S.S.; Ahmad, I. Convergence Analysis for Cayley Variational Inclusion Problem Involving XOR and XNOR Operations. Axioms; 2025; 14, 149. [DOI: https://dx.doi.org/10.3390/axioms14030149]
© 2025 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/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.