Next Article in Journal
A Comparison of Various Extensions of Strong Truthteller and Strong Liar Puzzles (Mutes and Crazies)
Previous Article in Journal
Ultimate Bounds for a Diabetes Mathematical Model Considering Glucose Homeostasis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Inertial Projection Algorithm for Solving Split Best Proximity Point and Mixed Equilibrium Problems in Hilbert Spaces

by
Shamshad Husain
1,
Faizan Ahmad Khan
2,*,
Mohd Furkan
3,
Mubashshir U. Khairoowala
1,* and
Nidal H. E. Eljaneid
2
1
Department of Applied Mathematics, Faculty of Engineering and Technology, Aligarh Muslim University, Aligarh 202002, India
2
Computational and Analytical Mathematics and Their Applications Research Group, Department of Mathematics, Faculty of Science, University of Tabuk, Tabuk 71491, Saudi Arabia
3
University Polytechnic, Faculty of Engineering and Technology, Aligarh Muslim University, Aligarh 202002, India
*
Authors to whom correspondence should be addressed.
Axioms 2022, 11(7), 321; https://doi.org/10.3390/axioms11070321
Submission received: 21 May 2022 / Revised: 19 June 2022 / Accepted: 23 June 2022 / Published: 1 July 2022

Abstract

:
The primary goal of this paper is to present and study an inertial projection algorithm for solving the split best proximity and mixed equilibrium problems. We find a solution of the best proximity problem in such a way that its image under a bounded linear operator is the solution of the mixed equilibrium problem under the setting of real Hilbert spaces. We construct an iterative algorithm for the proposed problem and prove a weak convergence theorem. Moreover, we deduce some consequences from the main convergence result. Finally, a numerical experiment is presented to demonstrate the convergence analysis of our algorithm. The methodology and results presented in this work improve and unify some previously published findings in this field.

1. Introduction

Let H j for j = 1, 2 be two real Hilbert spaces with the inner product · , · and the induced norm · . Let C j H 1 for j=1,2 and K H 2 be nonempty, closed and convex subsets of H 1 and H 2 , respectively.
In 1994, Blum and Oettli [1] introduced and studied the following equilibrium problem (EP):
Find q * C 1 such that ψ ( q * , q ) 0 , q C 1 ,
where ψ : C 1 × C 1 R is a bifunction. We represent the solution set of problem (1) by EP( ψ ) .
The equilibrium problem is a generalization of many mathematical models such as the variational inequality problem, fixed point problem, certain optimization problem, Nash equilibrium problem, minimization problem and others; (see [1,2,3]).
In 2011, Moudafi [4] introduced and studied the following split equilibrium problem (SEP):
Find q * C 1 such that ψ 1 ( q * , q ) 0 , q C 1 ,
and u * = B q * K solves ψ 2 ( u * , u ) 0 , u K ,
where ψ 1 : C 1 × C 1 R and ψ 2 : K × K R are two bifunction and B : H 1 H 2 is a bounded linear operator. We represent the solution set of problem (2) and problem (3) with EP( ψ 1 ) and EP( ψ 2 ), respectively. An important generalization of SEP (2) and (3) is the split mixed equilibrium problem (SMEP):
Find q * C 1 such that ψ 1 ( q * , q ) + f q * , q q * 0 , q C 1
and u * = B q * K solves ψ 2 ( u * , u ) + g u * , u u * 0 , u K ,
where f : H 1 H 1 and g : H 2 H 2 be two nonlinear mappings. When we looked separately (4) is the mixed equilibrium problem that Moudafi and Thera [5] introduced and studied in 1999. We represent the solution set of problem (4) and problem (5) by MEP( ψ 1 , f ) and MEP( ψ 2 , g ), respectively.
In 2018, Kazmi et al. [6] proposed and studied the following iterative algorithm: For a given x 0 H 1 , compute iterative sequence { x m } generated as follows:
u m = ( 1 ζ m ) x m + ζ m ( σ m S x m + ( 1 σ m ) Q x m ) , x m + 1 = U ( x m + τ B * ( V I ) B x m ) ,
where { ζ m } , { σ m } are two real sequences in (0, 1), U = Q r m ψ 1 ( I r m f ) , V = Q r m ψ 2 ( I r m g ) , S , Q : C 1 C 1 are two nonexpansive mappings and τ 0 , 1 B * 2 . Under some mild conditions, they proved that the sequence { x m } induced by (6) converges weakly to an element of the solution set of the mixed equilibrium problem and hierarchical fixed point problem.
On the other hand, if C 1 , C 2 H 1 are two nonempty, closed and convex sets with d ( C 1 , C 2 ) = inf { c 1 c 2 : c 1 C 1 and c 2 C 2 } and S : C 1 C 2 are a mapping. The best proximity problem (BPP) is defined as:
Find q * C 1 such that q * S q * = d ( C 1 , C 2 ) .
We represent the solution set of problem (7) by Best C 1 S . The best proximity point problem for nonlinear mappings is an interesting topic in the optimization theory (see [7,8,9]). It is well known that the concept of a best proximity point includes that of a fixed point as a specific case. Some authors have developed some methods for solving the best proximity point problems (see [10,11]) and equilibrium problem (see [1,5,12,13,14,15]).
In 2016, Suantai et al. [16] proposed and studied the following iterative algorithm for solving split equilibrium problem and fixed point problem of non-spreading multivalued mapping in real Hilbert spaces:
x 0 C 1 , y m = Q r m ψ 1 ( I τ B * ( I Q r m ψ 2 ) B ) x m , x m + 1 = ζ m x m + ( 1 ζ m ) S y m , m N ,
where { ζ m } (0, 1], r m (0, ), S is a non-spreading multivalued mapping and τ 0 , 1 L such that L is the spectral radius of B * B where B * is the adjoint of the bounded linear operator B . Under some mild conditions, they proved that the sequence { x m } induced by (8) converges weakly to an element of the common solution of split equilibrium problem and fixed point problem.
In 2019, Tiammee and Suantai [17] proposed and studied the following iterative algorithm for solving the split best proximity point and equilibrium problems in Hilbert spaces:
x 0 C 0 , y m = ( 1 ζ m ) x m + ζ m P C 1 S x m , x m + 1 = P C 1 ( y m + τ B * ( Q r m ψ 2 I ) B y m ) , m N ,
where { ζ m } (0,1], r m (0, ), and τ 0 , 1 B * 2 . Under some mild conditions, they proved that the sequence { x m } induced by (9) converges weakly to an element of the solution set Ω = { q * Best C 1 S : B q * EP ( ψ 2 ) } .
In this paper, we introduce and study a new split problem, which is called a split best proximity problem and mixed equilibrium problem (SBPMEP). Let C 1 , C 2 H 1 be two nonempty, closed and convex subsets of H 1 with d ( C 1 , C 2 ) = inf { c 1 c 2 : c 1 C 1 and c 2 C 2 } . Let K H 2 be a closed convex subset of H 2 and B : H 1 H 2 be a bounded linear operator. Let S : C 1 C 2 be a mapping, ψ : K × K R be a bifunction and g : H 2 H 2 be a nonlinear mapping. Then SBPMEP is defined as:
Find q * C 1 such that q * S q * = d ( C 1 , C 2 )
and u * = B q * K solves ψ ( u * , u ) + g u * , u u * 0 , u K .
We represent the solution set of SBPMEP by J = { q * Best C 1 S : B q * MEP ( ψ , g ) } . When we looked separately (10) is a classical best proximity point problem and (11) is a classical mixed equilibrium problem (see [18,19,20]).
In particular, the term ϑ m ( x m x m 1 ) , also known as the inertial extrapolation term was introduced as a useful tool for speeding up the convergence rate of iterative methods and many authors have investigated and improved the inertial type algorithm in various forms (see [21,22]).
Motivated and inspired by the work of Suantai et al. [16] and Tiammee and Suantai [17] and ongoing work in this direction, we propose and analyze an iterative algorithm for solving the SBPMEP (10) and (11) and establish a weak convergence theorem. The results obtained in this paper can be considered as the common solution of the best proximity point problem and mixed equilibrium problem and is a generalization of the recently published work by Tiammee and Suantai [17]. The iterative algorithm and results discussed in this paper are novel and can be viewed as a generalization and refinement of previously published work in this field.
The paper is organized as follows. In Section 1, we propose and formulate our problem and give a brief introduction of the work undertaken in this direction. In Section 2, we recall some concepts and results which are needed in proving the result presented in this paper. In Section 3, we prove a weak convergence theorem for an SBPMEP (10) and (11). In Section 4, we deduce some consequences from our main convergence theorem. In Section 5, we give a numerical example to justify our main convergence result while the conclusion is given in the last section.

2. Preliminaries

In this section, we need to review some basic definitions and lemmas that are required to prove our main convergence result. We denote the symbol ⇀ for weak convergence.
A mapping Q : H 1 H 1 is said to be
( i )
nonexpansive if
Q u * Q q * u * q * , u * , q * H 1 ;
( i i )
ζ -inverse strongly monotone if there exists ζ > 0 such that
Q u * Q q * , u * q * ζ Q u * Q q * 2 , u * , q * H 1 ;
( i i i )
quasi-nonexpansive if Fix( Q ) ϕ and
Q u * q * u * q * , u * H 1 , q * Fix ( Q ) ,
where Fix( Q ) = { q * C 1 : Q q * = q * } . Observe that nonexpansive mappings are quasi-nonexpansive.
Let C 1 and C 2 be two nonempty, closed and convex subsets of H 1 . We define the following sets by C 0 and D 0
C 0 = { u * C 1 : u * q * = D ( C 1 , C 2 ) , for some q * C 2 }
and
D 0 = { q * C 2 : u * q * = D ( C 1 , C 2 ) , for some u * C 1 } .
A metric projection P C 1 ( u * ) of u * H 1 is defined by
P C 1 ( u * ) = argmin { q * u * : q * C 1 } .
The projection operator P C 1 : H 1 C 1 has the well known properties which are described in the following lemma.
Lemma 1
([23]). Let C 1 be a nonempty, closed and convex subset of Hilbert space H 1 . Then u * , q * H 1 and z * C 1 ,
(a)
P C 1 u * u * , z * P C 1 u * 0 ;
(b)
P C 1 u * P C 1 q * 2 P C 1 u * P C 1 q * , u * q * ;
(c)
P C 1 u * z * 2 u * z * 2 P C 1 u * u * 2 ;
(d)
z * P C 1 u * 2 + u * P C 1 u * 2 u * z * 2 .
A Hilbert space H is said to satisfy Opial’s condition if, for any sequence { x m } in H such that x m u * , we have
lim inf m x m u * < lim inf m x m q * , u * , q * Y , u * q * .
Lemma 2
([11]). Let C 1 and C 2 be two nonempty subsets of a uniformly convex Banach space Y such that C 1 is closed and convex. Assume that Q : C 1 C 2 is a mapping such that Q ( C 0 ) D 0 . Then Fix ( P C 1 T | C 0 ) = Best C 1 ( Q ) .
Definition 1
([11]). Let C and D be two nonempty subsets of a real Hilbert space H 1 and C 1 a subset of C . A mapping Q : C D is called C 1 -nonexpansive if
Q u * Q z * u * z * , u * C , z * C 1 .
If C 1 = Best C Q , then Q is called a best proximally nonexpansive mapping.
Definition 2
([24]). Let C 1 and C 2 be two nonempty and closed subsets of a metric space ( Y , d ) . Then, C 1 and C 2 are said to satisfy the P-property if for u 1 , u 2 C 0 and q 1 , q 2 D 0 , the following implication holds:
d ( u 1 , q 1 ) = d ( u 2 , q 2 ) = D ( C 1 , C 2 ) d ( u 1 , u 2 ) = d ( q 1 , q 2 ) .
Notice that the P-property holds for any pair ( C 1 , C 2 ) of nonempty, closed and convex subsets of H 1 .
Lemma 3
([10]). Let C 1 and C 2 be two nonempty subsets of a uniformly convex Banach space Y such that C 1 is closed and convex. Suppose that Q : C 1 C 2 is mapping such that Q ( C 0 ) D 0 . Then Q | C 0 satisfies the proximal property iff ( I P C 1 Q ) | C 0 is demiclosed at zero.
Lemma 4
([1]). Let C 1 be a nonempty, closed and convex subset of H 1 and ψ : C 1 × C 1 R be a bifunction satisfying the following conditions:
(B1)
ψ ( u * , u * ) = 0 , u * C 1 ;
(B2)
ψ is monotone, i.e, ψ ( u * , q * ) + ψ ( q * , u * ) 0 , u * , q * C 1 ;
(B3)
For each u * , q * , z * C 1 , lim sup t ψ ( t z * + ( 1 t ) u * , q * ) ψ ( u * , q * ) ;
(B4)
For each u * C 1 , q * ψ ( u * , q * ) is convex and lower semicontinuous.
Lemma 5
([14]). Let C 1 be a nonempty, closed and convex subset of H 1 and let ψ : C 1 × C 1 R be a bifunction satisfying ( B 1 ) ( B 4 ) . Define a mapping Q r ψ : H 1 C 1 is defined by
Q r ψ ( u * ) = { z * C 1 : ψ ( z * , q * ) + 1 r q * z * , z * u * 0 , q * C 1 } , r > 0 , u * H 1 .
Then the following results holds:
(a)
Q r ψ is single-valued;
(b)
Q r ψ is firmly-nonexpansive, i.e,
Q r ψ ( u * ) Q r ψ ( q * ) 2 Q r ψ ( u * ) Q r ψ ( q * ) , u * q * , u * , q * H 1 ;
(c)
Fix ( Q r ψ ) = EP ( ψ ) ;
(d)
Fix ( Q r ψ ) is closed and convex.
Lemma 6
([25]). ( a ) For all u * , q * H 1 , we have
u * q * 2 = u * 2 q * 2 2 u * q * , q * ;
( b ) For any u * , q * H 1 , we have
2 u * , q * = u * 2 + q * 2 u * q * 2 = u * + q * 2 u * 2 q * 2 .
Lemma 7
([26]). Let { δ m } and { τ m } be non-negative sequences satisfying
m = 0 δ m < + and τ m + 1 τ m + δ m , m = 0 , 1 , 2 , . . . .
Then { τ m } is a convergent sequence.

3. Main Result

In this section, we prove our main convergence result based on the proposed iterative algorithm for solving SBPMEP (10) and (11).
Theorem 1.
Let C j H 1 for j=1,2 and K H 2 be nonempty, closed and convex subsets of H 1 and H 2 , respectively. Let B : H 1 H 2 be a bounded linear operator with adjoint operator B * . Let S : C 1 C 2 be best proximally nonexpansive mapping such that S ( C 0 ) D 0 with Best C 1 S ϕ . Let g : H 2 H 2 be a ζ-inverse strongly monotone mapping and let ψ : K × K R be a bifunction satisfying ( B 1 ) ( B 4 ) with MEP ( ψ , g ) ϕ . Suppose that S satisfies the proximal property. Let { x m } be a sequence generated by
x 0 , x 1 C 0 , w m = x m + ϑ m ( x m x m 1 ) , y m = ( 1 ζ m ) w m + ζ m P C 1 S w m , x m + 1 = P C 1 ( y m + τ B * ( V I ) B y m ) , m N ,
where V = Q r m ψ ( I r m g ) , { ζ m } (0,1], r m (0,∞), { ϑ m } [ 0 , ϑ ] for some ϑ [ 0 , 1 ) and τ 0 , 1 B * 2 is a constant. Suppose that J = { q * Best C 1 S : B q * MEP ( ψ , g ) } ϕ . Moreover, let the following conditions be satisfied:
(i)
m = 0 ϑ m x m x m 1 < ;
(ii)
lim sup m ζ m < 1 ;
(iii)
lim inf m r m > 0 .
Then, the sequence { x m } converges weakly to x * J .
Proof. 
Let q * J . Since P C 1 S w m S w m = D ( C 1 , C 2 ) and q * S q * = D ( C 1 , C 2 ) , using P-property, we have
P C 1 S w m q * = S w m S q * .
Since q * J , q * Best C 1 S . Now
w m q * = x m + ϑ m ( x m x m 1 ) q * = ( x m q * ) + ϑ m ( x m x m 1 ) x m q * + ϑ m x m x m 1 .
Since S is a best proximally nonexpansive mapping, using (13), we have
y m q * = ( 1 ζ m ) w m + ζ m P C 1 S w m q * = ( 1 ζ m ) ( w m q * ) + ζ m ( P C 1 S w m q * ) ( 1 ζ m ) w m q * + ζ m P C 1 S w m q * = ( 1 ζ m ) w m q * + ζ m S w m S q * = ( 1 ζ m ) w m q * + ζ m w m q * w m q * .
Moreover, since q * J , So q * Best C 1 S and B q * MEP ( ψ , g ) , we have
y m q * 2 = ( 1 ζ m ) w m q * 2 + ζ m P C 1 S w m q * 2 ζ m ( 1 ζ m ) P C 1 S w m w m 2 ( 1 ζ m ) w m q * 2 + ζ m w m q * 2 ζ m ( 1 ζ m ) P C 1 S w m w m 2 w m q * 2 ζ m ( 1 ζ m ) P C 1 S w m w m 2 .
By Lemma 5 and q * MEP ( ψ , g ) , we have
V B y m B q * 2 = V B y m V B q * 2 V B y m V B q * , B y m B q * = 1 2 V B y m V B q * 2 + B y m B q * 2 V B y m B y m 2 ,
which implies that
V B y m B q * 2 B y m B q * 2 V B y m B y m 2 .
Now, using (17) and Lemma 6 (b), we calculate
2 τ y m q * , B * ( V I ) B y m = 2 τ B y m B q * , ( V I ) B y m = 2 τ B y m B q * + ( V I ) B y m ( V I ) B y m , ( V I ) B y m = 2 τ { V B y m B q * , ( V I ) B y m ( V I ) B y m 2 } = τ { V B y m B q * 2 + ( V I ) B y m 2 B y m B q * 2 2 ( V I ) B y m 2 } τ { B y m B q * 2 B y m B q * 2 ( V I ) B y m 2 } = τ ( V I ) B y m 2 .
From (18), we obtain
x m + 1 q * 2 = P C 1 ( y m + τ B * ( V I ) B y m ) q * 2 = P C 1 ( y m + τ B * ( V I ) B y m ) P C 1 q * 2 ( y m + τ B * ( V I ) B y m ) q * 2 = y m q * 2 + τ 2 B * 2 ( V I ) B y m 2 + 2 τ y m q * , B * ( V I ) B y m y m q * 2 + τ 2 B * 2 ( V I ) B y m 2 τ ( V I ) B y m 2 y m q * 2 τ ( 1 τ B * 2 ) ( V I ) B y m 2 .
Since 0 < τ < 1 B * 2 and τ ( 1 τ B * 2 ) > 0 , it follows from (14), (15) and (19) that
x m + 1 q * y m q * w m q * x m q * + ϑ m x m x m 1 .
Therefore, from Lemma 7, lim m x m q * = r 0 . Again by (20), we have lim m w m q * = lim m y m q * = r . Consequently, { x m } is bounded. Hence, the sequences { w m } and { y m } are also bounded.
By (16), we have
lim m P C 1 S w m w m = 0 .
From (12) and (21), we obtain
lim m y m w m = 0 .
using (i) and we observe that
lim m w m x m = lim m ϑ m x m x m + 1 = 0 .
Since, by triangle inequality
y m x m y m w m + w m x m ,
from (22) and (23), we obtain
lim m y m x m = 0 .
As { w m } is bounded, { w m } has a weakly convergence subsequence { w m j } . Let us consider that w m j x * for some x * C 1 . Then, y m j x * and B y m j B x * by (22) and B is a bounded linear operator.
Since lim m y m q * = lim m x m q * = r , (19) implies that
lim m ( V I ) B y m = 0 .
Now, we prove that x * J , that is x * Best C 1 S and B x * MEP ( ψ , g ) . Since S satisfies proximal property, by Lemma 3, we have ( I P C 1 S ) | C 0 is demiclosed at zero. It follows from (21) that P C 1 S x * = x * , i.e, x * Best C 1 S .
Now, we prove that B x * MEP ( ψ , g ) . Since B is a bounded linear operator, we have B y m j B x * . Setting l m j = B y m j V B x * , we obtain l m j 0 and B y m j l m j = V B x * . Therefore, from Lemma 5, we have ψ ( B y m j l m j , z ) + g B y m j , z ( B y m j l m j )
+ 1 r m j z ( B y m j l m j ) , B y m j l m j B y m j 0 , z C 2 .
Since ψ is upper semicontinuous in the first argument, taking limsup to the above inequality as j and using (iii), we obtain
ψ ( B x * , z ) + g B x * , z B x * 0 , z C 2 ,
this implies that B x * MEP ( ψ , g ) . This shows that x * J .

4. Consequences

In this section, we deduce some special cases from our main convergence theorem.
In Theorem 1, if we take g 0 and ϑ m = 0 , we have the following result for solving the split best proximity problem and equilibrium problem which was initially studied and analyzed by Tiammee and Suantai [17].
Corollary 1.
Let H j for j = 1,2 be two real Hilbert spaces and let C j H 1 for j=1,2 and K H 2 be nonempty, closed and convex subsets of H 1 and H 2 , respectively. Let B : H 1 H 2 be a bounded linear operator with adjoint operator B * . Let S : C 1 C 2 be best proximally nonexpansive mapping such that S ( C 0 ) D 0 with Best C 1 S ϕ . Let ψ 2 : K × K R be a bifunction satisfying ( B 1 ) ( B 4 ) with EP ( ψ 2 ) ϕ . Assume that S satisfies the proximal property. Let { x m } be a sequence generated by
x 0 C 0 , y m = ( 1 ζ m ) w m + ζ m P C 1 S w m , x m + 1 = P C 1 ( y m + τ B * ( T r m ψ 2 I ) B y m ) , m N ,
where { ζ m } (0,1], r m (0,∞) and τ 0 , 1 B * 2 is a constant. Suppose that Ω = { q * Best C 1 S : B q * EP ( ψ 2 ) } ϕ . Moreover, let the following conditions be satisfied:
(i)
lim sup m ζ m < 1 ;
(ii)
lim inf m r m > 0 .
Then, the sequence { x m } converges weakly to x * Ω .
In Theorem 1, if H 1 = H 2 = H , K = C 1 and B = I , the identity mapping on H , then we have the following result to approximate a common solution of the best proximity problem (7) and mixed equilibrium problem (5).
Corollary 2.
Let H be a real Hilbert space and let C j H for j = 1, 2 be two nonempty, closed and convex subsets of H . Let S : C 1 C 2 be best proximally nonexpansive mapping such that S ( C 0 ) D 0 with Best C 1 S ϕ . Let g : H H be a ζ-inverse strongly monotone mapping and let ψ 2 : C 1 × C 1 R be a bifunction satisfying ( B 1 ) ( B 4 ) with MEP ( ψ 2 , g ) ϕ . Assume that S satisfies the proximal property. Let { x m } be a sequence generated by
x 0 , x 1 C 0 , w m = x m + ϑ m ( x m x m 1 ) , y m = ( 1 ζ m ) w m + ζ m P C 1 S w m , x m + 1 = ( 1 τ ) y m + τ ( V I ) y m , m N ,
where V = Q r m ψ 2 ( I r m g ) , { ζ m } (0,1], r m (0,∞), { ϑ m } [ 0 , ϑ ] for some ϑ [ 0 , 1 ) and τ 0 , 1 I 2 . Suppose that Best C 1 S MEP ( ψ 2 , g ) ϕ . Moreover, let the following conditions be satisfied:
(i)
m = 0 ϑ m x m x m 1 < ;
(ii)
lim sup m ζ m < 1 ;
(iii)
lim inf m r m > 0 .
Then, the sequence { x m } converges weakly to x * Best C 1 S MEP ( ψ 2 , g ) .
In Theorem 1, if H 1 = H 2 = H , K = C 1 and B = I , the identity mapping on H and g 0 , then we have the following result for solving best proximity problem (7) and equilibrium problem (3).
Corollary 3.
Let H be a real Hilbert space and let C j H for j=1,2 be two nonempty, closed and convex subsets of H . Let S : C 1 C 2 be best proximally nonexpansive mapping such that S ( C 0 ) D 0 with Best C 1 S ϕ . Let ψ 2 : C 1 × C 1 R be a bifunction satisfying ( B 1 ) ( B 4 ) with EP ( ψ 2 ) ϕ . Assume that S satisfies the proximal property. Let { x m } be a sequence generated by
x 0 , x 1 C 0 , w m = x m + ϑ m ( x m x m 1 ) , y m = ( 1 ζ m ) w m + ζ m P C 1 S w m , x m + 1 = ( 1 τ ) y m + τ Q r m ψ 2 y m , m N ,
where { ζ m } (0,1], r m (0,∞), { ϑ m } [ 0 , ϑ ] for some ϑ [ 0 , 1 ) and τ 0 , 1 I 2 . Suppose that Best C 1 S EP ( ψ 2 ) ϕ . Moreover, let the following conditions be satisfied:
(i)
m = 0 ϑ m x m x m 1 < ;
(ii)
lim sup m ζ m < 1 ;
(iii)
lim inf m r m > 0 .
Then, the sequence { x m } converges weakly to x * Best C 1 S EP ( ψ 2 ) .

5. Numerical Experiment

In this section, we present a numerical experiment to justify our main convergence result.
Example 1.
Let H 1 = H 2 = C 1 = C 2 = K = R , the set of real numbers, with the inner product defined by u * , q * = u * q * , u * , q * R , and induced usual norm | · | and C 0 = [ 10 , 10 ] . Let ψ : K × K R be defined as ψ ( u * , q * ) = u * q * u * 2 , u * , q * K and g : H 2 H 2 defined by g ( u * ) = 3 u * , u * H 2 . Let the mapping B : H 1 H 2 be defined by B ( u * ) = 9 u * 4 , u * H 1 and let the mapping S : C 1 C 2 be defined by S ( u * ) = u * 4 , u * C 1 . For r m = 1 5 , m , we compute that
Q r m ψ ( I r m g ) ( u * ) = 12 u * 25 .
It is easy to check that ψ satisfies ( B 1 ) ( B 4 ) and upper semicontinuous. B is a bounded linear operator on R with adjoint operator B * and B = B * = 9 4 , and hence, τ ( 0 , 16 81 ) . Therefore, we choose τ = 1 20 . Further, g is 1 3 -inverse strongly monotone mapping and let us choose ζ m = m 2 m + 1 , m 1 . It is easy to prove that MEP ( ψ , g ) = { 0 } and S is a best proximally nonexpansive mapping such that S ( C 0 ) D 0 with Best C 1 S = { 0 } . Therefore, J = { 0 } ϕ .
From Table 1 and Figure 1, it can be very well visualized that the sequence of iteration { x m } converges weakly to 0.

6. Conclusions

In this paper, we suggest and analyze an inertial projection algorithm for solving the split best proximity and mixed equilibrium problems. We approximate a solution of the best proximity problem in such a way that its image under a bounded linear operator is the solution of the mixed equilibrium problem under the setting of real Hilbert spaces. We construct an iterative algorithm for the proposed problem and prove a weak convergence theorem. Further, we deduce some special cases from our main convergence result. Finally, a numerical experiment has been presented to justify the convergence analysis of the proposed iterative algorithm.

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

  1. Blum, E.; Oettli, W. From optimization and variational inequalities to equilibrium problems. Math. Stud. 1994, 63, 123–145. [Google Scholar]
  2. Jolaoso, L.; Alakoya, T.; Taiwo, A.; Mewomo, O. Inertial extragradient method via viscosity approximation approach for solving equilibrium problem in Hilbert space. Optimization 2021, 70, 387–412. [Google Scholar] [CrossRef]
  3. Suantai, S.; Cholamjiak, P. Algorithms for solving generalized equilibrium problems and fixed points of nonexpansive semigroups in Hilbert spaces. Optimization 2014, 63, 799–815. [Google Scholar] [CrossRef]
  4. Moudafi, A. Split monotone variational inclusions. J. Optim. Theory Appl. 2011, 150, 275–283. [Google Scholar] [CrossRef]
  5. Moudafi, A.; Théra, M. Proximal and dynamical approaches to equilibrium problems. In Ill-Posed Variational Problems and Regularization Techniques; Springer: Berlin/Heidelberg, Germany, 1999; pp. 187–201. [Google Scholar]
  6. Kazmi, K.; Ali, R.; Furkan, M. Krasnoselski-Mann type iterative method for hierarchical fixed point problem and split mixed equilibrium problem. Numer. Algorithms 2018, 77, 289–308. [Google Scholar] [CrossRef]
  7. Basha, S.S. Best proximity points: Optimal solutions. J. Optim. Theory Appl. 2011, 151, 210–216. [Google Scholar]
  8. Gabeleh, M. Best proximity point theorems via proximal non-self mappings. J. Optim. Theory Appl. 2015, 164, 565–576. [Google Scholar] [CrossRef]
  9. Sadiq Basha, S. Best proximity points: Global optimal approximate solutions. J. Glob. Optim. 2011, 49, 15–21. [Google Scholar] [CrossRef]
  10. Bunlue, N.; Suantai, S. Hybrid algorithm for common best proximity points of some generalized nonself nonexpansive mappings. Math. Methods Appl. Sci. 2018, 41, 7655–7666. [Google Scholar] [CrossRef]
  11. Suparatulatorn, R.; Suantai, S. A new hybrid algorithm for global minimization of best proximity points in Hilbert spaces. Carpathian J. Math. 2019, 35, 95–102. [Google Scholar] [CrossRef]
  12. Chadli, O.; Ansari, Q.H.; Yao, J.C. Mixed equilibrium problems and anti-periodic solutions for nonlinear evolution equations. J. Optim. Theory Appl. 2016, 168, 410–440. [Google Scholar] [CrossRef]
  13. Chidume, C.; Nnakwe, M. A new Halpern-type algorithm for a generalized mixed equilibrium problem and a countable family of generalized nonexpansive-type maps. Carpathian J. Math. 2018, 34, 191–198. [Google Scholar] [CrossRef]
  14. Combettes, P.L.; Hirstoaga, S.A. Equilibrium programming in Hilbert spaces. J. Nonlinear Convex Anal. 2005, 6, 117–136. [Google Scholar]
  15. He, Z. The split equilibrium problem and its convergence algorithms. J. Inequalities Appl. 2012, 2012, 162. [Google Scholar] [CrossRef] [Green Version]
  16. Suantai, S.; Cholamjiak, P.; Cho, Y.J.; Cholamjiak, W. On solving split equilibrium problems and fixed point problems of nonspreading multi-valued mappings in Hilbert spaces. Fixed Point Theory Appl. 2016, 2016, 35. [Google Scholar] [CrossRef] [Green Version]
  17. Tiammee, J.; Suantai, S. On solving split best proximity point and equilibrium problems in Hilbert spaces. Carpathian J. Math. 2019, 35, 385–392. [Google Scholar] [CrossRef]
  18. Ceng, L.C.; Yao, J.C. A hybrid iterative scheme for mixed equilibrium problems and fixed point problems. J. Comput. Appl. Math. 2008, 214, 186–201. [Google Scholar] [CrossRef] [Green Version]
  19. Konnov, I.; Schaible, S.; Yao, J.C. Combined relaxation method for mixed equilibrium problems. J. Optim. Theory Appl. 2005, 126, 309–322. [Google Scholar] [CrossRef]
  20. Yao, Y.; Noor, M.A.; Zainab, S.; Liou, Y.C. Mixed equilibrium problems and optimization problems. J. Math. Anal. Appl. 2009, 354, 319–329. [Google Scholar] [CrossRef] [Green Version]
  21. 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]
  22. Maingé, P.E. Convergence theorems for inertial KM-type algorithms. J. Comput. Appl. Math. 2008, 219, 223–236. [Google Scholar] [CrossRef] [Green Version]
  23. Agarwal, R.P.; O’Regan, D.; Sahu, D. Fixed Point Theory for Lipschitzian-Type Mappings with Applications; Springer: Berlin/Heidelberg, Germany, 2009; Volume 6. [Google Scholar]
  24. Raj, V.S. Best proximity point theorems for non-self mappings. Fixed Point Theory 2013, 14, 447–454. [Google Scholar]
  25. Marino, G.; Xu, H.K. Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces. J. Math. Anal. Appl. 2007, 329, 336–346. [Google Scholar] [CrossRef] [Green Version]
  26. Combettes, P.L. Quasi-Fejérian analysis of some optimization algorithms. In Studies in Computational Mathematics; Elsevier: Amsterdam, The Netherlands, 2001; Volume 8, pp. 115–152. [Google Scholar]
Figure 1. Convergence of sequence { x m } .
Figure 1. Convergence of sequence { x m } .
Axioms 11 00321 g001
Table 1. Numerical experiment for two distinct initial values x 0 and x 1 .
Table 1. Numerical experiment for two distinct initial values x 0 and x 1 .
No. of Iterations x 0 = 2 , x 1 = 1.5 x 0 = 2 , x 1 = 1.5
12.000000−2.000000
4−0.0809130.080913
8−0.0394150.039415
120.022187−0.022187
16−0.0080310.008031
200.002478−0.002478
24−0.0006990.000699
280.000186−0.000186
32−0.0000470.000047
360.000011−0.000011
40−0.0000030.000003
440.000001−0.000001
480.0000000.000000
520.0000000.000000
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Husain, S.; Khan, F.A.; Furkan, M.; Khairoowala, M.U.; Eljaneid, N.H.E. Inertial Projection Algorithm for Solving Split Best Proximity Point and Mixed Equilibrium Problems in Hilbert Spaces. Axioms 2022, 11, 321. https://doi.org/10.3390/axioms11070321

AMA Style

Husain S, Khan FA, Furkan M, Khairoowala MU, Eljaneid NHE. Inertial Projection Algorithm for Solving Split Best Proximity Point and Mixed Equilibrium Problems in Hilbert Spaces. Axioms. 2022; 11(7):321. https://doi.org/10.3390/axioms11070321

Chicago/Turabian Style

Husain, Shamshad, Faizan Ahmad Khan, Mohd Furkan, Mubashshir U. Khairoowala, and Nidal H. E. Eljaneid. 2022. "Inertial Projection Algorithm for Solving Split Best Proximity Point and Mixed Equilibrium Problems in Hilbert Spaces" Axioms 11, no. 7: 321. https://doi.org/10.3390/axioms11070321

APA Style

Husain, S., Khan, F. A., Furkan, M., Khairoowala, M. U., & Eljaneid, N. H. E. (2022). Inertial Projection Algorithm for Solving Split Best Proximity Point and Mixed Equilibrium Problems in Hilbert Spaces. Axioms, 11(7), 321. https://doi.org/10.3390/axioms11070321

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop