All articles published by MDPI are made immediately available worldwide under an open access license. No special
permission is required to reuse all or part of the article published by MDPI, including figures and tables. For
articles published under an open access Creative Common CC BY license, any part of the article may be reused without
permission provided that the original article is clearly cited. For more information, please refer to
https://www.mdpi.com/openaccess.
Feature papers represent the most advanced research with significant potential for high impact in the field. A Feature
Paper should be a substantial original Article that involves several techniques or approaches, provides an outlook for
future research directions and describes possible research applications.
Feature papers are submitted upon individual invitation or recommendation by the scientific editors and must receive
positive feedback from the reviewers.
Editor’s Choice articles are based on recommendations by the scientific editors of MDPI journals from around the world.
Editors select a small number of articles recently published in the journal that they believe will be particularly
interesting to readers, or important in the respective research area. The aim is to provide a snapshot of some of the
most exciting work published in the various research areas of the journal.
We formulate an iterative approach employing the inertial technique to approximate the anticipated solution for a generalized mixed variational-like inequality, as well as variational inequality and fixed point problems associated with a relatively nonexpansive multivalued mapping within the context of a real Banach space. Additionally, we delve into the robust convergence of our suggested algorithm. Furthermore, we highlight certain implications and present numerical observations to underscore the significance of our findings. The proposed theorem extends and consolidates several previously published works.
Throughout the entire article, unless explicitly stated otherwise, we assume that Y is a two-uniformly convex and uniformly smooth Banach space, with denoting its dual. Let X represent a nonempty closed convex subset of Y. The fixed point problem (FPP) associated with a mapping is defined as the set . The normalized duality mapping, denoted as , is defined by , for all . This mapping assigns to each vector a set of linear functionals in the dual space that satisfies specific orthogonality conditions.
The Lyapunov function, denoted as , is defined as follows:
This Lyapunov function quantifies the distance between two vectors in the space Y through their norms and the action of the normalized duality mapping J.
It is essential to note that the characterization of the metric projection on a subset of a Hilbert space as nonexpansive is specific to Hilbert spaces, and is not readily applicable to more general Banach spaces. To address this limitation, Alber [1] introduced an operator in Banach space known as the generalized projection, as further discussed in [2]. The generalized projection extends the notion of projection to Banach spaces, providing a useful tool for solving optimization problems in more general functional settings.
We provide a concise overview of our proposed problem and its specific cases. We introduce the generalized mixed variational-like inequality problem (GMVLIP) as follows: Seek satisfying
where and . The solution to (2) is denoted as Sol(GMVLIP(2)). When , GMVLIP (2) simplifies to
which represents the general variational-like inequality problem (GVLIP), as seen in [3,4]. Additionally, if , where and , then (2) transforms into the mixed variational-like inequality problem (MVLIP) initiated by Noor [5]. Furthermore, by setting and , GMVLIP (2) becomes the variational-like inequality problem (VLIP), expressed as
as illustrated by Parida et al. [6]. This holds significant importance in mathematical programming. If we set for all , then the VLIP transforms into the classical variational inequality problem (abbreviated as VIP) [7], expressed as
Its solution is denoted as Sol(VIP (4)). If we set , where and , then GMVLIP (2) transforms into the equilibrium problem (abbreviated as EP) as
which was initiated by Blum et al. [8] in 1994. Its solution is described as Sol(EP (5)).
The generalized mixed variational-like inequality problem is recognized as a trifunction equilibrium problem. Consequently, the equilibrium problem can be viewed as a special case within the broader context of the trifunction equilibrium problem. The equilibrium problem is widely acknowledged for its substantial impact on the advancement of various scientific and engineering domains. Remarkably, it has become evident that many well-known problems can be conceptualized within the framework of the equilibrium problem, providing a natural, innovative, and unified approach to addressing issues in nonlinear analysis, optimization, economics, finance, game theory, physics, and engineering.
The theories developed for the equilibrium problem have demonstrated their applicability to numerous problems. Notably, this theoretical framework serves as a unifying structure for diverse problems encountered in mathematical programming, variational inclusion, variational inequality, complementary problems, saddle point problems, Nash equilibrium problems in noncooperative games, minimax inequality problems, minimization problems, and fixed point problems, as highlighted in [8,9,10,11,12].
In 1953, Mann [13] introduced an iterative algorithm for nonexpansive single-valued mappings and investigated weak convergence. Building upon Mann’s work, Haugazeau [14] introduced a hybrid projection iterative algorithm (HPIA) as an advancement. Subsequently, in 2003, Nakajo et al. [15] presented an HPIA that incorporates metric projection for a nonexpansive single-valued mapping in a Hilbert space, demonstrating strong convergence under specific parameter conditions.
In 2005, Matsushita et al. [16] introduced a hybrid iterative algorithm involving generalized projection, considering a more general space, namely, a Banach space. The algorithm is described by the following steps:
For additional sources and in-depth exploration, see [15,17,18,19,20].
In 1973, Markin [21] introduced the fixed point problem (FPP) for multivalued nonexpansive mappings, with wide-ranging applications in fields such as convex optimization and control theory, as demonstrated in [22,23,24]. In 2011, Homaeipour et al. [25] proposed an iterative scheme featuring a relatively nonexpansive multivalued mapping T, as outlined below:
Homaeipour et al. observed convergence of the sequence under specific conditions on the control sequence. In a more recent study, Zegeye et al. [26] delved into an iterative approach aimed at approximating the common solution of the equilibrium problem (EP) and the fixed point problem (FPP) for relatively nonexpansive multivalued mappings. Their work includes a comprehensive convergence analysis under suitable parameter conditions. Very recently, Taiwo et al. [27] introduced the following Halpern-S-iteration method:
Their objective was to approximate the common solution of the equilibrium problem (EP) and the fixed point problem (FPP) for relatively nonexpansive multivalued mappings within uniformly convex and uniformly smooth Banach spaces. Furthermore, they successfully established strong convergence under appropriate conditions on the parameters.
A potent approach for enhancing the convergence rate of iterative algorithms involves incorporating an inertial term into the iterative scheme. Represented by , this term proves to be a valuable tool for boosting algorithmic performance, manifesting favorable convergence characteristics. The notion of the inertial extrapolation method was first introduced by Polyak [28], drawing inspiration from an implicit discretization of a second-order-in-time dissipative dynamical system known as the “Heavy Ball with Friction”.
In 2008, Mainge [29] introduced an inertial Krasnosel’skiǐ–Mann algorithm, which integrates the Krasnosel’skiǐ–Mann algorithm with inertial extrapolation
for each . Mainge demonstrated that the sequence generated by the algorithm converges weakly to a fixed point of T under certain conditions on parameters. This development has ignited growing interest among researchers in this field, as evident in works such as [30,31,32,33,34,35].
Question: Could we apply the inertial technique involving the projection method for solving GMVLIP, VIP, and FPP for relatively nonexpansive multivalued mapping in the setting of two-uniformly convex and uniformly smooth Banach space?
Explanations: Exploring the synergy of the inertial technique with a projection method holds promise in addressing the challenges posed by the generalized mixed variational-like inequality problem (GMVLIP), variational inequality problem (VIP), and fixed point problem (FPP) associated with relatively nonexpansive multivalued mappings. This approach, especially when implemented in the realm of a two-uniformly convex and uniformly smooth Banach space, capitalizes on the inherent geometric and analytical advantages of such spaces. The inertial term, designed to expedite convergence through judicious extrapolation, combines seamlessly with the projection method, forming a robust strategy to tackle these intricate problems. Leveraging the unique properties of the Banach space, this combined methodology exhibits the potential for enhanced computational efficiency and convergence rates. This avenue of research opens doors to innovative solutions for a broad spectrum of applications in mathematical analysis and optimization.
Building upon the pioneering work of Taiwo et al. [27], Zegeye et al. [26], Mainge [29], and Farid et al. [9], we introduce a novel iterative algorithm incorporating the inertial technique. This algorithm is designed to ascertain the common solution of the generalized mixed variational-like inequality problem (GMVLIP), variational inequality problem (VIP), and fixed point problem (FPP) for relatively nonexpansive multivalued mappings. Our investigation into the strong convergence properties of this proposed method unveils specific aspects of our theorem, emphasizing its robustness. Furthermore, we conduct a computational analysis to underscore the significance of our findings and draw meaningful comparisons. The results presented in this paper contribute to the extension and unification of numerous previously established outcomes in this specific research domain.
The iterative model for variational-like inequality problems and related problems has several uses and applications, including
(1)
Numerical Solutions: Iterative models provide numerical solutions to variational-like inequality problems, offering a computational approach to finding approximate solutions when analytical solutions are challenging or not feasible.
(2)
Versatility Across Problem Classes: Iterative models can be adapted to solve various problem classes, such as variational inequalities, fixed point problems, and generalized mixed variational-like inequalities. This versatility makes them valuable tools for addressing a wide range of mathematical and optimization challenges.
(3)
Convergence Analysis: The iterative nature of these models allows for the study of convergence properties. Convergence analysis helps understand the behavior of the iterative process and establishes conditions under which the algorithm converges to a solution.
(4)
Image Reconstruction in Medical Imaging: In medical imaging, iterative models are used for image reconstruction problems formulated as variational inequalities. They provide a framework for obtaining high-quality images from noisy or incomplete data.
In essence, iterative models for variational-like inequality problems provide powerful computational tools with broad applications across mathematics, optimization, and various applied sciences. Their adaptability, versatility, and ability to handle complex, real-world problems make them valuable in both theoretical analysis and practical problem solving.
In summary, the study’s limitations include potential applicability restrictions to certain Banach spaces, algorithm complexity for practical implementation, sensitivity to parameter choices, possible slow convergence rates, lack of real-world validation, and limited generalization to other problem classes. Additionally, the algorithm’s sensitivity to initial guesses poses a consideration for its robustness. These factors highlight areas for further investigation and refinement in future research.
Our paper is organized as follows: In Section 2, we provide a comprehensive explanation of fundamental concepts and conduct a review of established results. Section 3 encapsulates our primary contributions, featuring the main theoretical developments, numerical analyses, and graphical presentations. The interpretation and implications of our work are thoroughly discussed in Section 4.
2. Preliminaries
In this section, we lay the groundwork for our study by presenting key preliminaries and fundamental concepts essential to understanding the subsequent theoretical developments. We delve into the background literature, outlining established results and theoretical frameworks that form the basis of our research. This foundation serves as a crucial stepping stone for the detailed exposition of our main contributions in the subsequent sections. In the context of a Banach space Y, the space is deemed strictly convex if the following condition holds: for all distinct , where . This strict convexity criterion ensures a distinct separation between vectors in the unit sphere.
The modulus of smoothness on Y is a mathematical operator denoted by and defined as follows:
If for all , then Y is termed a smooth space, and it is considered uniformly smooth if the limit holds.
Furthermore, the modulus of convexity on X is represented by and defined as follows:
A space Y is termed uniformly convex if for all . In the broader context, a space Y is considered p-uniformly convex if there exists a constant such that for all , as detailed in [36]. For further elucidation, please refer to the cited source. Let us consider the space , the space of square-summable sequences equipped with the standard norm. This space is both two-uniformly convex and uniformly smooth.
The function defined in (1), introduced by Alber [1], exhibits well-established properties for any , and . These fundamental properties, deeply rooted in the theory of Banach spaces, serve as a cornerstone in various mathematical analyses and optimization frameworks.
(L1)
;
(L2)
;
(L3)
;
(L4)
.
Moving forward, we introduce the functional , defined as
It is notable that , establishing a connection between and the previously defined Lyapunov function . Moreover, demonstrates convexity in its second argument. Furthermore,
where this convexity property holds for all and , as established in [1]. These properties lay the groundwork for a deeper understanding of the behavior and properties of the functional in various mathematical and analytical contexts.
An element is considered an asymptotic fixed point of if there exists a sequence with such that . The set of asymptotic fixed points is denoted as . A map T is deemed relatively nonexpansive if .
Consider as a family of subsets of X, and as a family of closed bounded subsets of X. The Hausdorff metric, denoted as , between and , where , is defined as
where .
A map is nonexpansive if . An element is considered an asymptotic fixed point if there exists a sequence such that and .
A map T is said to be relatively nonexpansive if and for all , , and . It is worth noting that Homaeipour et al. [25] provided a counterexample for a relatively nonexpansive multivalued mapping that is not nonexpansive. The concept of relative nonexpansiveness provides a broader understanding of the behavior of multivalued mappings, encompassing cases where traditional nonexpansiveness may not be applicable.
Relatively nonexpansive multivalued mappings in Banach spaces have applications in various fields. Here are some examples:
(1)
Fixed Point Theory: Relatively nonexpansive multivalued mappings are fundamental in fixed point theory. They play a crucial role in proving the existence and uniqueness of fixed points in Banach spaces.
(2)
Projection Operators: Multivalued projection operators onto convex sets are examples of relatively nonexpansive multivalued mappings. These operators find applications in solving variational inequalities and convex optimization problems.
(3)
Image Reconstruction: In medical imaging and signal processing, relatively nonexpansive multivalued mappings are applied to image reconstruction problems. They help in preserving certain structures in the reconstructed images.
(4)
Control Theory: In control theory, relatively nonexpansive multivalued mappings are used to model and analyze the behavior of dynamic systems. They play a role in stability analysis and controller design.
These applications highlight the versatility and importance of relatively nonexpansive multivalued mappings in various mathematical and applied areas.
Definition1.
A map is characterized by the following properties:
(i)
It is monotone if ;
(ii)
It is σ-inverse strongly monotone (ism) if , such that
(iii)
It is Lipschitz continuous if , such that .
Lemma1
([36]).In a two-uniformly convex Banach space Y, for any , the following inequality is satisfied:
where and c is referred to as the two-uniformly convex constant of Y.
Lemma2
([37]).In a smooth and uniformly convex Banach space Y, consider two sequences and in Y, such that either or is bounded. If then .
Remark1
([37]).Certainly, when both sequences and are bounded, the converse of Lemma 2 holds as well.
Lemma3
([18]).Consider a nonempty closed convex subset X of Y, a real Banach space, and D be a monotone and hemicontinuous mapping from X into . Then, the solution set of the variational inequality problem, denoted as , is closed and convex.
Lemma4
([25]).Consider a strictly convex and smooth Banach space Y with a nonempty closed convex subset X. Let be a relatively nonexpansive multivalued mapping. Then, the fixed point set is closed and convex.
Lemma5
([1]).In a reflexive, strictly convex, and smooth Banach space Y, consider a nonempty closed convex subset X. Then, and , the inequality
holds, where denotes the generalized projection onto X.
Lemma6
([1]).In a reflexive, strictly convex Banach space Y, with X being a nonempty closed convex subset of a smooth Banach space Y, for any and , the following equivalence holds:
Lemma7
([38]).For a nondecreasing sequence of real numbers that increases at infinity, there exists a subsequence such that for all . Moreover, for a nondecreasing sequence with and , the following inequalities hold:
Lemma8
([20]).Let be a closed ball of Y, a uniformly convex Banach space. Then, , a continuous strictly increasing convex function with such that
where with and .
Lemma9
([39]).In the context of a p-uniformly convex Banach space E, the relationship between metric and Bregman distance is characterized by the following inequalities:
where is a fixed positive number. Additionally, using Young’s inequality for any and , we can further establish
These relationships highlight the interplay between the metric and Bregman distance in the specific setting of p-uniformly convex Banach spaces, providing valuable insights into the geometric properties of these spaces.
Lemma10
([40]).Given a sequence of nonnegative real numbers satisfying the condition
where , , , , and , it follows that . This result is established under the specified conditions on the sequence and provides insight into the convergence behavior of .
Assumption1
([9]).The given assumptions on the function are as follows:
(i)
b is skew-symmetric, i.e.,
(ii)
b is convex in the second argument;
(iii)
b is continuous.
These conditions characterize the behavior of the function b with respect to skew symmetry, convexity in the second argument, and continuity. The auxiliary problems associated with the generalized mixed variational-like inequality problem (GMVLIP) (2) are formulated as follows: find such that
These auxiliary problems involve the function , and they play a role in finding a solution x that satisfies the conditions specified in the inequality (10).
The paragraph describes the assumptions and conditions for the auxiliary problems, denoted as AP (10), associated with the generalized mixed variational-like inequality problem (GMVLIP). The conditions for the existence of a solution to AP (10) are outlined as follows:
Lemma11
([41]).Let X be a nonempty closed, convex, and bounded subset of a smooth strictly convex and reflexive Banach space Y. The function satisfies Assumption 1 (ii)–(iii) and is a bifunction. Additionally, , , and . The following conditions are assumed:
(i)
is hemicontinuous;
(ii)
is convex and lower semicontinuous;
(iii)
;
(iv)
is generalized relaxed α-monotone, satisfying the inequality
where such that
(v)
is lower semicontinuous.
Under these conditions, it is asserted that AP (10) has a solution.
The paragraph introduces a mapping defined for a given and . The mapping is defined as follows:
The paragraph indicates that the subsequent discussion will focus on examining certain properties of the mapping .
Lemma12
([41]).Consider a nonempty, closed, convex, and bounded subset X of a smooth, strictly convex, and reflexive Banach space Y. Let satisfy all the conditions outlined in Lemma 11, and let adhere to the assumptions of 1. Assume the mapping is defined as in (11). The ensuing properties can be established:
(i)
is single-valued;
(ii)
;
(iii)
is closed and convex;
(iv)
for all , .
3. Main Result
Theorem1.
Let Y denote a two-uniformly convex and uniformly smooth real Banach space with dual space and X be a nonempty closed convex subset of Y. Consider a trifunction adhering to the conditions of Lemma 11, featuring continuous , and a bifunction satisfying Assumption 1. Let be a σ-ism mapping, with . Additionally, let , where , form a finite family of relatively nonexpansive multivalued mappings. Assume . Let the sequence be generated by following iterative
In the given conditions, where , , with , , and for with , along with satisfying . For any , the following assumption is made:
Under these conditions, it can be concluded that the sequence converges strongly to , where .
Proof.
Firstly, we demonstrate that the sequence is bounded. To establish this, we take an arbitrary . Then, we estimate, as follows, using Lemmas 5 and 6:
By implementing (14), (17), (20), and applying induction, we obtain
Indeed, this implies that is bounded. Consequently, , , , and are also bounded.
Next, we demonstrate that and . Let . For any and using (7), we compute
By utilizing Lemmas 8 and 12, the fact that is relatively nonexpansive, and (21), we obtain
and thus,
Now, we consider two cases:
Case 1. Assume that for some , is monotonically nonincreasing for all , and since is bounded, it must be convergent. Therefore, by utilizing (22), it follows that and as . Additionally, employing Lemma 2, we can further deduce
Also, by implementing (22), as , which yields that , and thus, by using uniform continuity of , we have
By the concept of generalized relaxed -monotonicity of and (35), we have
Through the lower semicontinuity of in the first argument, continuity of in the second argument, continuity of b, , and (36), we obtain
Let Since , we get , and hence,
which implies that
Since is hemicontinuous, we have
which implies
Hence, . Thus, .
Further, we show that . Using (32), (34), and the concept of T, we get , which yields that . Hence, . By applying Lemma 6, we get . Thus, according to Lemma 10 and (23), as . Further, using Lemma 2, we observe that .
Case 2. Assume is not monotonically decreasing. Then, there exists a subsequence of with , . By applying Lemma 7, there exists a nondecreasing sequence with and , for . Using (22), we get
Using similar arguments to those of case 1, we have for each , , and as .
Since , for each ; therefore, from (37) and (38), we have and as . Also, , for each ; therefore, as . Thus, based on the above two cases, we observe that the sequence converges strongly to . □
Building upon the results established in Theorem 1, we derive several corollaries that extend the applicability and significance of the proposed iterative approach. These corollaries encapsulate key insights obtained from the main theorem, providing a structured overview of its broader implications. Moreover, they pave the way for the exploration and application of the presented iterative scheme across various mathematical and computational domains.
If we specialize Theorem 1 by considering the case where , a pertinent corollary unfolds. This focused examination serves to enhance our understanding of the iterative process and its relevance in singular cases.
Corollary1.
In a real Banach space Y, assumed to be two-uniformly convex and uniformly smooth with the dual space Y, consider a trifunction adhering to the conditions of Lemma 11, featuring continuous , and a bifunction satisfying Assumption 1. Let be a σ-ism mapping, with . Additionally, let be a relatively nonexpansive multivalued mapping. Assume the nonempty intersection is not empty. Then, the sequence generated by (12) converges strongly to , where .
Continuing in the same vein, we delve into additional implications and consequences stemming from the conditions outlined in Theorem 1, particularly when and b are explicitly assumed to be zero.
Corollary2.
In a real Banach space Y, assumed to be two-uniformly convex and uniformly smooth with the dual space . Let be a σ-ism mapping, with . Additionally, let , where , form a finite family of relatively nonexpansive multivalued mappings. Assume the nonempty intersection is not empty. Then, the sequence generated by (12) converges strongly to , where .
Remark2.
If Y is a Hilbert space denoted as H, then the dual space coincides with H, and the mapping J becomes the identity operator I. The function can be expressed as for all , with c representing the two-uniformly convex constant of Y. Additionally, the operator corresponds to the metric projection onto the convex set X. Notably, in the context of Hilbert spaces, the concept of a relatively nonexpansive mapping aligns with that of a nonexpansive mapping. These simplifications emerge from the inherent properties and structures of Hilbert spaces, facilitating a more straightforward interpretation of various operations and concepts.
Verification: Let us consider the Hilbert space with the standard Euclidean inner product. The Riesz representation theorem tells us that the dual space of is isomorphic to itself.
Now, let us take a specific vector in , say . According to the Riesz representation theorem, the corresponding linear functional in the dual space is given by , where u is any vector in .
Now, let us normalize by dividing it by its norm. The norm of is (the Euclidean norm of v). So, the normalized dual functional is .
For any vector in , the normalized dual functional evaluates to
Now, let us consider this normalized dual functional in the context of the Hilbert space. If we take a vector , the inner product is equal to . This value is exactly the same as the evaluation of the normalized dual functional on .
So, in this numerical example, normalizing the dual functional yields a corresponding vector in the Hilbert space, illustrating the concept of the normalized duality mapping as an identity mapping in this context.
4. Numerical Example
Example1.
Consider the real space and the closed convex subset . For any , define the functions , , and . Let D be a -ism mapping, specifically , and . It is evident that and b satisfy Assumption 1. Moreover, , and for any , it holds that .
Let . Then, there exists a sequence with and as . This implies that , and consequently, . Therefore, , signifying that T is relatively nonexpansive. Since , therefore, for any
Assume , which is a quadratic relation in and its discriminant is
which is a complete square. This means that is single-valued. Thus, . Note that in this scenario, the parameters are chosen as , , , and . For each , . Choose
.
Then, the sequence , originated by (12), converges to .
To compute and compare the results, MATLAB R2015(a) was utilized. The same initial points were used for both the proposed algorithm and Mainge’s algorithm, while for Homaeipur et al., only was employed. The stopping criterion for the computation was set as . The computed and compared results are presented in Table 1 and Table 2 and Figure 1 and Figure 2, respectively.
5. Conclusions
In summary, our investigation has led to several notable discoveries. The algorithm proposed in this study demonstrates robust convergence within the context of a two-uniformly convex and uniformly smooth real Banach space, featuring a relatively nonexpansive multivalued mapping. The theoretical results find support in numerical experiments conducted using Matlab R2015(a). Comparative analyses with existing algorithms, including those by Homaeipour et al. and Mainge, were performed under consistent conditions. The results, detailed in Table 1 and Table 2 and Figure 1 and Figure 2, underscore the effectiveness of our approach in terms of convergence behavior. These findings contribute valuable insights to ongoing research in optimization algorithms, highlighting the potential applicability of the proposed method in diverse contexts.
Author Contributions
M.F.: Writing—Original Draft, Software; S.F.A.: Review and Editing. All authors have read and agreed to the published version of the manuscript.
Funding
The APC was funded by Deanship of Scientific Research, Qassim University, Saudi Arabia.
Data Availability Statement
Data are contained within the article.
Acknowledgments
Researchers would like to thank the Deanship of Scientific Research, Qassim University for funding publication of this project.
Conflicts of Interest
The authors declare that they have no competing interests.
References
Alber, Y.I. Metric and generalized projection operators in Banach spaces. In Theory and Applications of Nonlinear Operators of Accretive and Monotone Type; Dekker: New York, NY, USA, 1996; pp. 15–50. [Google Scholar]
Reich, S. A weak convergence theorem for the alternating method with Bregman distances. In Theory and Applications of Nonlinear Operators of Accretive and Monotone Type; Kartsatos, A.G., Ed.; Lecture Notes in Pure and Applied Mathematics; Dekker: New York, NY, USA, 1996; Volume 178, pp. 313–318. [Google Scholar]
Mahato, N.K.; Nahak, C. Hybrid projection methods for the general variational-like inequality problems. J. Adv. Math. Stud.2013, 6, 143–158. [Google Scholar]
Preda, V.; Beldiman, M.; Batatoresou, A. On variational-like inequalities with generalized monotone mappings. In Generalized Convexity and Related Topics; Lecture Notes in Economics and Mathematical Systems; Springer: Berlin/Heidelberg, Germany, 2006; Volume 583, pp. 415–431. [Google Scholar]
Noor, M.A. General nonlinear mixed variational-like inequalities. Optimization1996, 37, 357–367. [Google Scholar] [CrossRef]
Parida, J.; Sahoo, M.; Kumar, A. A variational-like inequalitiy problem. Bull. Austral. Math. Soc.1989, 39, 225–231. [Google Scholar] [CrossRef]
Hartman, P.; Stampacchia, G. On some non-linear elliptic differential-functional equation. Acta Mathenatica1996, 115, 271–310. [Google Scholar] [CrossRef]
Blum, E.; Oettli, W. From optimization and variational inequalities to equilibrium problems. Math. Stud.1994, 63, 123–145. [Google Scholar]
Farid, M.; Cholamjiak, W.; Ali, R.; Kazmi, K.R. A new shrinking projection algorithm for a generalized mixed variational-like inequality problem and asymptotically quasi-ϕ-nonexpansive mapping in a Banach space. Rev. Real Acad. Cienc. Exactas FíSicas Nat. Ser. MatemáTicas2021, 115, 114. [Google Scholar]
Khan, M.B.; Noor, M.A.; Noor, K.I.; Chu, Y.M. Higher-Order Strongly Preinvex Fuzzy Mappings and Fuzzy Mixed Variational-Like Inequalities. Int. J. Comput. Intell.2021, 14, 1856–1870. [Google Scholar] [CrossRef]
Moudafi, A. Second order differential proximal methods for equilibrium problems. J. Inequal. Pure Appl. Math.2003, 4, 18. [Google Scholar]
Daniele, P.; Giannessi, F.; Mougeri, A. (Eds.) Equilibrium Problems and Variational Models; Nonconvex Optimization and Its Application; Kluwer Academic Publications: Norwell, MA, USA, 2003; Volume 68. [Google Scholar]
Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc.1953, 4, 506–510. [Google Scholar] [CrossRef]
Haugazeau, Y. Sur les Inequations Variationnelles et la Minimisation de Fonctionnelles Convexes. These, Universite de Paris. 1968. Available online: https://cir.nii.ac.jp/crid/1572261550817940096 (accessed on 12 December 2023).
Nakajo, K.; Takahashi, W. Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups. J. Math. Anal. Appl.2003, 279, 372–379. [Google Scholar] [CrossRef]
Matsushita, S.Y.; Takahashi, W. A strong convergence theorem for relatively nonexpansive mappings in a Banach space. J. Approx. Theory2005, 134, 257–266. [Google Scholar] [CrossRef]
Farid, M.; Irfan, S.S.; Khan, M.F.; Khan, S.A. Strong convergence of gradient projection method for generalized equilibrium problem in a Banach space. J. Inequalities Appl.2017, 2017, 297. [Google Scholar] [CrossRef] [PubMed]
Nakajo, K. Strong convergence for gradient projection method and relatively nonexpansive mappings in Banach spaces. Appl. Math. Comput.2017, 271, 251–258. [Google Scholar] [CrossRef]
Takahashi, W.; Zembayashi, K. Strong and weak convergence theorems for equilibrium problems and relatively nonexpansive mappings in Banach spaces. Nonlinear Anal.2009, 70, 45–57. [Google Scholar] [CrossRef]
Zegeye, H.; Ofoedu, E.U.; Shahzad, N. Convergence theorems for equilibrium problem, variational inequality problem and countably infinite relatively quasi-nonexpansive mappings. Appl. Math. Comput.2010, 216, 3439–3449. [Google Scholar] [CrossRef]
Markin, J.T. Continuous dependence of fixed point sets. Proc. Am. Math. Soc.1973, 38, 545–547. [Google Scholar] [CrossRef]
Górniewicz, L. Topological Fixed Point Theory of Multivalued Mappings. In Mathematics and Its Applications; Kluwer Academic: Dordrecht, The Netherlands, 1999; Volume 495. [Google Scholar]
Lim, T.C. A fixed point theorem for multivalued nonexpansive mappings in a uniformly convex Banach space. Bull. Am. Math. Soc.1974, 80, 1123–1126. [Google Scholar] [CrossRef]
Homaeipour, S.; Razani, A. Weak and strong convergence theorems for relatively nonexpansive multi-valued mappings in Banach spaces. Fixed Point Theory Appl.2011, 2011, 73. [Google Scholar] [CrossRef]
Zegeye, H.; Shahzad, N. Convergence theorems for a common point of solutions of equilibrium and fixed point of relatively nonexpansive multivalued mapping problems. Abstr. Appl. Anal.2012, 2012, 859598. [Google Scholar] [CrossRef]
Taiwo, A.; Alakoya, T.O.; Mewomo, O.T. Strong convergence theorem for fixed points of relatively nonexpansive multi-valued mappings and equilibrium problems in Banach spaces. Asian-Eur. J. Math.2021, 14, 2150137. [Google Scholar] [CrossRef]
Polyak, B.T. Some methods of speeding up the convergence of iterates methods. USSR Comput. Math. Math. Phys.1964, 4, 1–17. [Google Scholar] [CrossRef]
Maingé, P.E. Convergence theorem for inertial KM-type algorithms. J. Comput. Appl. Math.2019, 219, 223–236. [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]
Bot, R.I.; Csetnek, E.R.; Hendrich, C. Inertial Douglas-Rachford splitting for monotone inclusion problems. Appl. Math. Comput.2015, 256, 472–487. [Google Scholar]
Alansari, M.; Ali, R.; Farid, M. Strong convergence of an inertial iterative algorithm for variational inequality problem, generalized equilibrium problem, and fixed point problem in a Banach space. J. Inequalities Appl.2020, 2020, 42. [Google Scholar] [CrossRef]
Tan, B.; Cho, S.Y.; Yao, J.C. Accelerated inertial subgradient extragradientalgorithms with non-monotonic step sizes for equilibrium problemsand fixed point problems. J. Nonlinear Var. Anal.2022, 6, 89–122. [Google Scholar]
Farid, M.; Ali, R.; Kazmi, K.R. Inertial iterative method for a generalized mixed equilibrium, variational inequality and a fixed point problems for a family of quasi-ϕ-nonexpansive mappings. Filomat2023, 37, 6133–6150. [Google Scholar]
Zhang, Y.; Wang, Y. A new inertial iterative algorithm for splitnull point and common fixed point problems. J. Nonlinear Funct. Anal.2023, 2023, 36. [Google Scholar]
Xu, H.K. Inequalities in Banach spaces with applications. Nonlinear Anal.1991, 16, 1127–1138. [Google Scholar] [CrossRef]
Kamimura, S.; Takahashi, W. Strong convergence of a proximal-type algorithim in a Banach space. SIAM J. Optim.2002, 13, 938–945. [Google Scholar] [CrossRef]
Maingé, P.E. Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Anal.2008, 16, 899–912. [Google Scholar] [CrossRef]
Schopfer, F.; Schuster, T.; Louis, A.K. An iterative regularization method for solving the split feasibility problem in Banach spaces. Inverse Probl.2008, 24, 055008. [Google Scholar] [CrossRef]
Kazmi, K.R.; Ali, R. Hybrid projection methgod for a system of unrelated generalized mixed variational-like inequality problems. Georgian Math. J.2019, 26, 63–78. [Google Scholar] [CrossRef]
Figure 1.
Producing a plot to visually depict the numerical insights outlined in Table 1 [25,29].
Figure 1.
Producing a plot to visually depict the numerical insights outlined in Table 1 [25,29].
Figure 2.
Producing a plot to visually depict the numerical insights outlined in Table 2 [25,29].
Figure 2.
Producing a plot to visually depict the numerical insights outlined in Table 2 [25,29].
Table 1.
Numerical observations corresponding to the initial point .
Table 1.
Numerical observations corresponding to the initial point .
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.
Farid, M.; Aldosary, S.F.
An Iterative Approach with the Inertial Method for Solving Variational-like Inequality Problems with Multivalued Mappings in a Banach Space. Symmetry2024, 16, 139.
https://doi.org/10.3390/sym16020139
AMA Style
Farid M, Aldosary SF.
An Iterative Approach with the Inertial Method for Solving Variational-like Inequality Problems with Multivalued Mappings in a Banach Space. Symmetry. 2024; 16(2):139.
https://doi.org/10.3390/sym16020139
Chicago/Turabian Style
Farid, Mohammad, and Saud Fahad Aldosary.
2024. "An Iterative Approach with the Inertial Method for Solving Variational-like Inequality Problems with Multivalued Mappings in a Banach Space" Symmetry 16, no. 2: 139.
https://doi.org/10.3390/sym16020139
APA Style
Farid, M., & Aldosary, S. F.
(2024). An Iterative Approach with the Inertial Method for Solving Variational-like Inequality Problems with Multivalued Mappings in a Banach Space. Symmetry, 16(2), 139.
https://doi.org/10.3390/sym16020139
Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.
Article Metrics
No
No
Article Access Statistics
For more information on the journal statistics, click here.
Multiple requests from the same IP address are counted as one view.
Farid, M.; Aldosary, S.F.
An Iterative Approach with the Inertial Method for Solving Variational-like Inequality Problems with Multivalued Mappings in a Banach Space. Symmetry2024, 16, 139.
https://doi.org/10.3390/sym16020139
AMA Style
Farid M, Aldosary SF.
An Iterative Approach with the Inertial Method for Solving Variational-like Inequality Problems with Multivalued Mappings in a Banach Space. Symmetry. 2024; 16(2):139.
https://doi.org/10.3390/sym16020139
Chicago/Turabian Style
Farid, Mohammad, and Saud Fahad Aldosary.
2024. "An Iterative Approach with the Inertial Method for Solving Variational-like Inequality Problems with Multivalued Mappings in a Banach Space" Symmetry 16, no. 2: 139.
https://doi.org/10.3390/sym16020139
APA Style
Farid, M., & Aldosary, S. F.
(2024). An Iterative Approach with the Inertial Method for Solving Variational-like Inequality Problems with Multivalued Mappings in a Banach Space. Symmetry, 16(2), 139.
https://doi.org/10.3390/sym16020139
Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.