Relaxed Projection Methods with Self-Adaptive Step Size for Solving Variational Inequality and Fixed Point Problems for an Infinite Family of Multivalued Relatively Nonexpansive Mappings in Banach Spaces
In each iteration, the projection methods require computing at least one projection onto the closed convex set. However, projections onto a general closed convex set are not easily executed, a fact that might affect the efficiency and applicability of the projection methods. To overcome this drawbac...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-08-01
|
| Series: | Mathematical and Computational Applications |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2297-8747/25/3/54 |
| _version_ | 1797556091407564800 |
|---|---|
| author | Safeer Hussain Khan Timilehin Opeyemi Alakoya Oluwatosin Temitope Mewomo |
| author_facet | Safeer Hussain Khan Timilehin Opeyemi Alakoya Oluwatosin Temitope Mewomo |
| author_sort | Safeer Hussain Khan |
| collection | DOAJ |
| description | In each iteration, the projection methods require computing at least one projection onto the closed convex set. However, projections onto a general closed convex set are not easily executed, a fact that might affect the efficiency and applicability of the projection methods. To overcome this drawback, we propose two iterative methods with self-adaptive step size that combines the Halpern method with a relaxed projection method for approximating a common solution of variational inequality and fixed point problems for an infinite family of multivalued relatively nonexpansive mappings in the setting of Banach spaces. The core of our algorithms is to replace every projection onto the closed convex set with a projection onto some half-space and this guarantees the easy implementation of our proposed methods. Moreover, the step size of each algorithm is self-adaptive. We prove strong convergence theorems without the knowledge of the Lipschitz constant of the monotone operator and we apply our results to finding a common solution of constrained convex minimization and fixed point problems in Banach spaces. Finally, we present some numerical examples in order to demonstrate the efficiency of our algorithms in comparison with some recent iterative methods. |
| first_indexed | 2024-03-10T16:56:47Z |
| format | Article |
| id | doaj.art-590b9b6196b943a6868a150273b61073 |
| institution | Directory Open Access Journal |
| issn | 1300-686X 2297-8747 |
| language | English |
| last_indexed | 2024-03-10T16:56:47Z |
| publishDate | 2020-08-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematical and Computational Applications |
| spelling | doaj.art-590b9b6196b943a6868a150273b610732023-11-20T11:06:24ZengMDPI AGMathematical and Computational Applications1300-686X2297-87472020-08-012535410.3390/mca25030054Relaxed Projection Methods with Self-Adaptive Step Size for Solving Variational Inequality and Fixed Point Problems for an Infinite Family of Multivalued Relatively Nonexpansive Mappings in Banach SpacesSafeer Hussain Khan0Timilehin Opeyemi Alakoya1Oluwatosin Temitope Mewomo2Department of Mathematics, Statistics and Physics, Qatar University, Doha 2713, QatarSchool of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Durban 4001, South AfricaSchool of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Durban 4001, South AfricaIn each iteration, the projection methods require computing at least one projection onto the closed convex set. However, projections onto a general closed convex set are not easily executed, a fact that might affect the efficiency and applicability of the projection methods. To overcome this drawback, we propose two iterative methods with self-adaptive step size that combines the Halpern method with a relaxed projection method for approximating a common solution of variational inequality and fixed point problems for an infinite family of multivalued relatively nonexpansive mappings in the setting of Banach spaces. The core of our algorithms is to replace every projection onto the closed convex set with a projection onto some half-space and this guarantees the easy implementation of our proposed methods. Moreover, the step size of each algorithm is self-adaptive. We prove strong convergence theorems without the knowledge of the Lipschitz constant of the monotone operator and we apply our results to finding a common solution of constrained convex minimization and fixed point problems in Banach spaces. Finally, we present some numerical examples in order to demonstrate the efficiency of our algorithms in comparison with some recent iterative methods.https://www.mdpi.com/2297-8747/25/3/54Halpernprojection methodself-adaptivestep sizevariational inequality problemsfixed point problems |
| spellingShingle | Safeer Hussain Khan Timilehin Opeyemi Alakoya Oluwatosin Temitope Mewomo Relaxed Projection Methods with Self-Adaptive Step Size for Solving Variational Inequality and Fixed Point Problems for an Infinite Family of Multivalued Relatively Nonexpansive Mappings in Banach Spaces Mathematical and Computational Applications Halpern projection method self-adaptive step size variational inequality problems fixed point problems |
| title | Relaxed Projection Methods with Self-Adaptive Step Size for Solving Variational Inequality and Fixed Point Problems for an Infinite Family of Multivalued Relatively Nonexpansive Mappings in Banach Spaces |
| title_full | Relaxed Projection Methods with Self-Adaptive Step Size for Solving Variational Inequality and Fixed Point Problems for an Infinite Family of Multivalued Relatively Nonexpansive Mappings in Banach Spaces |
| title_fullStr | Relaxed Projection Methods with Self-Adaptive Step Size for Solving Variational Inequality and Fixed Point Problems for an Infinite Family of Multivalued Relatively Nonexpansive Mappings in Banach Spaces |
| title_full_unstemmed | Relaxed Projection Methods with Self-Adaptive Step Size for Solving Variational Inequality and Fixed Point Problems for an Infinite Family of Multivalued Relatively Nonexpansive Mappings in Banach Spaces |
| title_short | Relaxed Projection Methods with Self-Adaptive Step Size for Solving Variational Inequality and Fixed Point Problems for an Infinite Family of Multivalued Relatively Nonexpansive Mappings in Banach Spaces |
| title_sort | relaxed projection methods with self adaptive step size for solving variational inequality and fixed point problems for an infinite family of multivalued relatively nonexpansive mappings in banach spaces |
| topic | Halpern projection method self-adaptive step size variational inequality problems fixed point problems |
| url | https://www.mdpi.com/2297-8747/25/3/54 |
| work_keys_str_mv | AT safeerhussainkhan relaxedprojectionmethodswithselfadaptivestepsizeforsolvingvariationalinequalityandfixedpointproblemsforaninfinitefamilyofmultivaluedrelativelynonexpansivemappingsinbanachspaces AT timilehinopeyemialakoya relaxedprojectionmethodswithselfadaptivestepsizeforsolvingvariationalinequalityandfixedpointproblemsforaninfinitefamilyofmultivaluedrelativelynonexpansivemappingsinbanachspaces AT oluwatosintemitopemewomo relaxedprojectionmethodswithselfadaptivestepsizeforsolvingvariationalinequalityandfixedpointproblemsforaninfinitefamilyofmultivaluedrelativelynonexpansivemappingsinbanachspaces |