In this paper, we expanded from the convex case to the nonconvex case in the setting of reflexive smooth Banach spaces, the concept of the f-generalized projection πfS:X∗→S initially introduced for convex sets and convex functions in [
Citation: Messaoud Bounkhel. Generalized (f,λ)-projection operator on closed nonconvex sets and its applications in reflexive smooth Banach spaces[J]. AIMS Mathematics, 2023, 8(12): 29555-29568. doi: 10.3934/math.20231513
[1] | Messaoud Bounkhel . $ V $-Moreau envelope of nonconvex functions on smooth Banach spaces. AIMS Mathematics, 2024, 9(10): 28589-28610. doi: 10.3934/math.20241387 |
[2] | Premyuda Dechboon, Abubakar Adamu, Poom Kumam . A generalized Halpern-type forward-backward splitting algorithm for solving variational inclusion problems. AIMS Mathematics, 2023, 8(5): 11037-11056. doi: 10.3934/math.2023559 |
[3] | Messaoud Bounkhel, Bushra R. Al-sinan . A differential equation approach for solving implicit state-dependent convex sweeping processes in Banach spaces. AIMS Mathematics, 2024, 9(1): 2123-2136. doi: 10.3934/math.2024106 |
[4] | Lu-Chuan Ceng, Yeong-Cheng Liou, Tzu-Chien Yin . On Mann-type accelerated projection methods for pseudomonotone variational inequalities and common fixed points in Banach spaces. AIMS Mathematics, 2023, 8(9): 21138-21160. doi: 10.3934/math.20231077 |
[5] | Meiying Wang, Luoyi Shi, Cuijuan Guo . An inertial iterative method for solving split equality problem in Banach spaces. AIMS Mathematics, 2022, 7(10): 17628-17646. doi: 10.3934/math.2022971 |
[6] | Damrongsak Yambangwai, Chonjaroen Chairatsiripong, Tanakit Thianwan . Iterative manner involving sunny nonexpansive retractions for nonlinear operators from the perspective of convex programming as applicable to differential problems, image restoration and signal recovery. AIMS Mathematics, 2023, 8(3): 7163-7195. doi: 10.3934/math.2023361 |
[7] | Shahram Rezapour, Maryam Iqbal, Afshan Batool, Sina Etemad, Thongchai Botmart . A new modified iterative scheme for finding common fixed points in Banach spaces: application in variational inequality problems. AIMS Mathematics, 2023, 8(3): 5980-5997. doi: 10.3934/math.2023301 |
[8] | Hasanen A. Hammad, Hassan Almusawa . Modified inertial Ishikawa iterations for fixed points of nonexpansive mappings with an application. AIMS Mathematics, 2022, 7(4): 6984-7000. doi: 10.3934/math.2022388 |
[9] | Kaiwich Baewnoi, Damrongsak Yambangwai, Tanakit Thianwan . A novel algorithm with an inertial technique for fixed points of nonexpansive mappings and zeros of accretive operators in Banach spaces. AIMS Mathematics, 2024, 9(3): 6424-6444. doi: 10.3934/math.2024313 |
[10] | Buthinah A. Bin Dehaish, Rawan K. Alharbi . On fixed point results for some generalized nonexpansive mappings. AIMS Mathematics, 2023, 8(3): 5763-5778. doi: 10.3934/math.2023290 |
In this paper, we expanded from the convex case to the nonconvex case in the setting of reflexive smooth Banach spaces, the concept of the f-generalized projection πfS:X∗→S initially introduced for convex sets and convex functions in [
Let X be a Banach space with dual space X∗. The duality pairing between X and X∗ will be denoted by ⟨⋅,⋅⟩. We denote by B and B∗ the closed unit ball in X and X∗, respectively. The normalized duality mapping J:X→→X∗ is defined by
J(x)={j(x)∈X∗:⟨j(x),x⟩=‖x‖2=‖j(x)‖2}, |
where ‖⋅‖ stands for both norms on X and X∗. Many properties of J are well known and we refer the reader, for instance, to the book [17].
Definition 1.1. For a fixed closed subset S of X, a fixed function f:S→R∪{∞}, and a fixed λ>0, we define the following functional: GVλ,f:X∗×S→R∪{∞}
GVλ,f(x∗,x)=f(x)+12λV(x∗,x),∀x∗∈X∗,x∈S, |
where V(x∗,x)=‖x∗‖2−2⟨x∗,x⟩+‖x‖2. Using the functional GVλ,f, we define the generalized (f,λ)-projection on S as follows:
πf,λS(x∗)={x∈S:GVλ,f(x∗,x)=eVλ,Sf(x∗):=infs∈SGVλ,f(x∗,s)},for any x∗∈X∗. |
Remark 1.1.
● If f=0, then πf,λS coincides with the generalized projection πS introduced for closed convex sets in [2,3,13,14] and for closed nonconvex sets in [6,7].
● If λ=12, then πf,λS coincides with the f-generalized projection introduced for closed convex sets in [19,20].
● If X is a Hilbert space and f=0, then πf,λS coincides with the well-known metric projection ProjS in [11].
● If X is a Hilbert space, the functional x∗↦eVλ,Sf(x∗)=infs∈SGVλ,f(x∗,s) coincides with the Moreau envelope of f with index λ>0.
Motivated by the previous remarks, we are going to study the above concept of generalized projection in smooth Banach spaces. Our results will extend many existing works in the literature.
We commence by considering the following example, which serves to demonstrate that πf,λS(x∗) may be empty for nonconvex closed sets even for convex continuous functions f in uniformly convex and uniformly smooth Banach spaces.
Example 2.1. Let X=ℓp (p≥1), 0X∗=(0,…,0,…)∈(lp)∗, and let S:={e1,e2,⋯,en,⋯} with ej=(0,⋯,0,j+1j,0,⋯). Let λ>0 and f:X→R be defined as f(x)=‖x‖−1, then S is a closed nonconvex subset in X with πf,λS(0X∗)=∅.
Proof. Undoubtedly, the set S is a closed nonconvex set and the function f is convex continuous on X. Let us show that the (f,λ)-generalized projection of 0X∗ is empty. Let x be any element of S, then for some n≥1, x=en and
f(x)+12λV(0X;x)=f(x)+12λ‖x‖2=f(en)+12λ(1+1n)2>12λ. |
Then, for any x∈S, we have f(x)+12λV(0X∗;x)>12λ; that is,
12λ≤infx∈S[f(x)+12λV(0X∗;x)]≤lim infn→∞[f(en)+12λV(0X∗;en)]≤lim infn→∞[1n+12λ(1+1n)2]=12λ, | (2.1) |
and so
infx∈S[f(x)+12λV(0X∗;x)]=12λ. |
This ensures that πf,λS(0X∗)=∅. Indeed, if πf,λS(0X∗)≠∅, then there exists some ˉx∈πf,λS(0X∗), and so ˉx=en0 for some n0≥1, with
infx∈S[f(x)+12λV(0X∗;x)]=f(ˉx)+12λV(0X∗;ˉx). |
Hence,
12λ=f(en0)+12λV(0X∗;en0)=1n0+12λ(1+1n0)2=1n0+12λ(1+2n0+1n20) |
and
1n0+1n0λ+12λn20=0, |
which is not possible, and so πf,λS(0X∗)=∅.
From the previous example, we see that even in uniformly convex and uniformly smooth Banach spaces, the (f,λ)-generalized projection πf,λS(x∗) may be empty for closed nonconvex sets. Thus, it is hopeless to get the conclusion of Theorem 2.1 in [19] and Theorem 3.1 in [20] saying that πf,λS(x∗)≠∅, ∀x∗∈X∗ whenever S is a closed convex set in reflexive Banach spaces. However, we are going to prove that for closed nonconvex sets, the set of points x∗∈X∗ for which πf,λS(x∗)≠∅ is dense in X∗. We are going to prove our main result in the following theorem. First, we need to recall that an extended real-valued function f defined on X is said to be lower semicontinous (in short l.s.c.) on its domain provided that its epigraph epi f:={(x,r)∈X×R:f(x)≤r} is closed in X×R.
Theorem 2.1. Assume that X is a reflexive Banach space with smooth dual norm, and let S be any closed nonempty set of X and f:S→R∪{∞} be any l.s.c. function. Then, the set of points in X∗ admitting the unique (f,λ)-generalized projection on S are dense in X∗; that is, for any x∗∈X∗, there exists x∗n→x∗ with πf,λS(x∗n)≠∅,∀n.
Proof. By definition of πf,λS(x∗), we have
πf,λS(x∗)={ˉx∈S::eVλ,Sf(x∗)=f(ˉx)+12λV(x∗,ˉx)}. |
Observe that
eVλ,Sf(z∗)=infy∈X{−1λ⟨z∗;y⟩+f(y)+12λ[‖z∗‖2+‖y‖2)]+ψS(y)}=‖z∗‖22λ−supy∈X{1λ⟨z∗;y⟩−f(y)−‖y‖22λ−ψS(y)}=‖z∗‖22λ−ℓf,λ(z∗), |
with ℓf,λ(z∗):=supy∈X{1λ⟨z∗;y⟩−f(y)−‖y‖22λ−ψS(y)}. Clearly, the function ℓf,λ is convex on a reflexive Banach space X∗, and so there exists a dense set K in X∗ in which the Fréchet gradient exists; that is, ∇Fℓf,λ(x∗) exists for any x∗∈K. Now, we use the smoothness of the dual norm to get the existence of ∇F‖⋅‖(x∗) for any x∗≠0 in X∗. Thus, for any x∗∈K, the Fréchet derivative ∇FeVλ,Sf(x∗) exists with ∇FeVλ,Sf(x∗)=12λ∇F‖⋅‖2(x∗)−∇Fℓf,λ(x∗). Fix any ϵ>0. Now, we use the definition of Fréchet differentiability to obtain some δ>0 such that
⟨∇FeVλ,Sf(x∗);u∗−x∗⟩≤eVλ,Sf(u∗)−eVλ,Sf(x∗)+ϵ‖u∗−x∗‖∀u∗∈x∗+δB∗. |
Fix any t∈(0,δ) and any v∗∈B∗, then
⟨∇FeVλ,Sf(x∗);tv∗⟩≤eVλ,Sf(x∗+tv∗)−eVλ,Sf(x∗)+ϵt. |
By definition of the infimum in eVλ,Sf(x∗), there exists for any n≥1 some point xn∈S such that
eVλ,Sf(x∗)≤f(xn)+12λV(x∗,xn)<eVλ,Sf(x∗)+tn. | (2.2) |
Therefore,
⟨∇FeVλ,Sf(x∗);tv∗⟩≤f(xn)+12λV(x∗+tv∗,xn)−f(xn)−12λV(x∗,xn)+tn+ϵt≤12λ[‖x∗+tv∗‖2−‖x∗‖2−2⟨tv∗,xn⟩]+tn+ϵt. |
Hence,
⟨∇FeVλ,Sf(x∗)+xnλ;v∗⟩≤12λt−1[‖x∗+tv∗‖2−‖x∗‖2]+1n+ϵ. |
Using the fact that ∇F‖⋅‖2(x∗)=2J∗x∗ to write
t−1[‖x∗+tv∗‖2−‖x∗‖2−2⟨J∗x∗,v∗⟩]≤ϵ, |
we find that
⟨∇FeVλ,Sf(x∗)+xn−J∗x∗λ;v∗⟩≤1n+ϵ+ϵ2λ,∀n≥1,∀ϵ>0,∀v∗∈B∗, |
which gives
‖∇FeVλ,Sf(x∗)+xn−J∗x∗λ‖≤1n+ϵ(12λ+1),∀n≥1,∀ϵ>0. |
By taking n→∞ and ϵ→0, we obtain the convergence of the sequence (xn)n to ˉx:=J∗x∗−λ∇FeVλ,Sf(x∗). Taking n→∞ in (2.2), we obtain eVλ,Sf(x∗)=f(ˉx)+12λV(x∗,ˉx), which means that ˉx∈πf,λS(x∗).
Let us prove that the set πf,λS(x∗) reduces to the single limit ˉx. Let ˉy≠ˉx with ˉy∈πf,λS(x∗), so eVλ,Sf(x∗)=f(ˉy)+12λV(x∗,ˉy). Proceeding as before with the constant minimizing sequence yn:=ˉy, we get
‖∇FeVλ,Sf(x∗)+ˉy−J∗x∗λ‖≤2ϵ,∀ϵ>0 |
and, hence; ˉy=J∗x∗−λ∇FdVS(x∗), which means that ˉy=ˉx. That is, πf,λS(x∗)={ˉx}, and so the proof is complete.
After proving the density of the domain of the operator πf,λS in the previous section, in this section we continue with the study of various important properties of the operator πf,λS.
Theorem 3.1. Assume that X is a reflexive Banach space with smooth dual norm. Let S be a closed subset in X, λ>0, and f:X→R∪{∞} be a l.s.c function, then the following conclusions hold:
(1) If f is bounded below on S, then the set πf,λS(x∗) is closed bounded in X, for any x∗∈domπf,λS;
(2) For any x∗1,x∗2∈domπf,λS and any x1∈πf,λS(x∗1) and x2∈πf,λS(x∗2) we have
⟨x∗1−x∗2;x1−x2⟩≥0; |
(3) For any x∗∈domπf,λS, any ˉx∈πf,λS(x∗), and any t∈[0,1) we have πf,λS(J(ˉx)+t(x∗−J(ˉx)))={ˉx}.
Proof. (1) Let x∗∈domπf,λS. Let α∈R be the lower bound of f on S. That is, f(x)>α for any x∈S. Then, for any x∈πf,λS(x∗),
eVλ,Sf(x∗)=f(x)+12λV(x∗;x)≥α+12λ[‖x∗‖−‖x‖]2, |
which ensures that πf,λS(x∗) is bounded. Now, we prove that πf,λS(x∗) is closed. Let {xn}n be a sequence in πf,λS(x∗) converging to a limit ˉx. We have to prove that ˉx∈πf,λS(x∗). By l.s.c. of f and the continuity of V, we have
eVλ,Sf(x∗)=f(ˉx)+12λV(x∗;ˉx)≤lim infn[f(xn)+12λV(x∗;xn)]=infs∈S[f(s)+12λV(x∗;s)]=eVλ,Sf(x∗). |
Thus, ˉx∈πf,λS(x∗).
(2) Let x∗i∈domπf,λS and xi∈πf,λS(x∗i) for i=1,2, then by definition of eVλ,Sf(x∗i) we have
eVλ,Sf(x∗1)=f(x1)+12λV(x∗1;x1)≤f(x2)+12λV(x∗1;x2),eVλ,Sf(x∗2)=f(x2)+12λV(x∗2;x2)≤f(x1)+12λV(x∗2;x1). |
Adding these two inequalities yields
V(x∗1;x1)+V(x∗2;x2)≤V(x∗1;x2)+V(x∗2;x1) |
and, hence, by decomposition and rearrangement, we obtain
⟨x∗2−x∗1;x2−x1⟩≥0, |
and the proof of (2) is complete.
(3) First, we prove that for any ˉx∈πf,λS(x∗) and any t∈[0,1), we have
ˉx∈πf,tλS(Jˉx+t(x∗−Jˉx)). |
Let ˉx∈πf,λS(x∗), then
f(ˉx)+12λV(x∗;ˉx)≤f(y)+12λV(x∗;y),∀y∈S |
and
12λ[V(x∗;ˉx)−V(x∗;y)]≤f(y)−f(ˉx),∀y∈S. |
First, observe that
⟨Jˉx+t(x∗−Jˉx)−Jˉx;y−ˉx⟩=t⟨x∗−Jˉx;y−ˉx⟩. |
We distinguish two cases:
Case 1. If ⟨x∗−Jˉx;y−ˉx⟩≤λ[f(y)−f(ˉx)], then we have
V(Jˉx+t(x∗−Jˉx);ˉx)−V(Jˉx+t(x∗−Jˉx);y)=2t⟨x∗−Jˉx;y−ˉx⟩−V(Jˉx;y)≤2tλ[f(y)−f(ˉx)]−V(Jˉx;y)≤2tλ[f(y)−f(ˉx)]. |
Case 2. If ⟨x∗−Jˉx;y−ˉx⟩>λ[f(y)−f(ˉx)], and since t∈[0,1), we have
2t⟨x∗−Jˉx;y−ˉx⟩−2tλ[f(y)−f(ˉx)]<2⟨x∗−Jˉx;y−ˉx⟩−2λ[f(y)−f(ˉx)], |
and so
2t⟨x∗−Jˉx;y−ˉx⟩=2t⟨x∗−Jˉx;y−ˉx⟩−2tλ[f(y)−f(ˉx)]+2tλ[f(y)−f(ˉx)]<2⟨x∗−Jˉx;y−ˉx⟩−2λ[f(y)−f(ˉx)]+2tλ[f(y)−f(ˉx)]<(‖x∗‖2−2⟨x∗;ˉx⟩+‖ˉx‖2)+2λ(t−1)[f(y)−f(ˉx)]+(2⟨x∗;y⟩−‖x∗‖2−‖y‖2)+(‖y‖2−2⟨Jˉx;y⟩+‖ˉx‖2)<V(x∗,ˉx)−V(x∗,y)+V(Jˉx,y)+2λ(t−1)[f(y)−f(ˉx)]<2λ[f(y)−f(ˉx)]+V(Jˉx,y)+2λ(t−1)[f(y)−f(ˉx)]<V(Jˉx,y)+2tλ[f(y)−f(ˉx)]. |
Thus,
2t⟨x∗−Jˉx;y−ˉx⟩−V(Jˉx;y)≤2tλ[f(y)−f(ˉx)] |
and, hence,
V(Jˉx+t(x∗−Jˉx);ˉx)−V(Jˉx+t(x∗−Jˉx);y)≤2tλ[f(y)−f(ˉx)]. |
Therefore, in both Case 1 and 2, we have
V(Jˉx+t(x∗−Jˉx);ˉx)−V(Jˉx+t(x∗−Jˉx);y)≤2tλ[f(y)−f(ˉx)],∀y∈S,∀t∈[0,1), |
which is equivalent to
V(Jˉx+t(x∗−Jˉx);ˉx)+2tλf(ˉx)≤V(Jˉx+t(x∗−Jˉx);y)+2tλf(y),∀y∈S,∀t∈[0,1). |
Hence,
f(ˉx)+12tλV(Jˉx+t(x∗−Jˉx);ˉx)≤f(y)+12tλV(Jˉx+t(x∗−Jˉx);y),∀y∈S,∀t∈(0,1); |
that is, ˉx∈πf,tλS(Jˉx+t(x∗−Jˉx)), for any t∈(0,1).
Uniqueness. Now, let us prove the uniqueness. That is, for any t∈(0,1) and for any xt∈πf,tλS(Jˉx+t(x∗−Jˉx)), we have to prove that xt=ˉx. To do that, fix t∈(0,1) and let ut:=J∗(Jˉx+t(x∗−Jˉx)). Let xt≠x with xt∈πf,tλS(Jut), then
f(ˉx)+12tλV(Jut;ˉx)=infs∈S[f(s)+12tλV(Jut;s)]=f(xt)+12tλV(Jut;xt), |
and so
V(Jut;ˉx)−V(Jut;xt)=2tλ[f(xt)−f(ˉx)]. |
A direct decomposition of the left hand side of this equality yields to
V(Jut;ˉx)−V(Jut;xt)=‖ˉx‖2−‖xt‖2−2⟨Jut;ˉx−xt⟩=t[‖ˉx‖2−2⟨x∗;ˉx−xt⟩−‖xt‖2]+(1−t)[‖ˉx‖2−2⟨Jˉx;ˉx−xt⟩−‖xt‖2]=t[V(x∗;ˉx)−V(x∗;xt)]−(1−t)V(Jˉx;xt) |
and, hence,
t[V(x∗;ˉx)−V(x∗;xt)]−(1−t)V(Jˉx;xt)=2tλ[f(xt)−f(ˉx)]. |
Thus,
1−t2tλV(Jˉx;xt)=[f(ˉx)+12λV(x∗;ˉx)]−[f(xt)+12λ[V(x∗;xt)]. | (3.1) |
On the other hand, we use the fact that xt∈S and ˉx∈πf,λS(x∗) to write f(ˉx)+12λV(x∗;ˉx)≤f(xt)+12λV(x∗;xt), which, together with the previous equality (3.1), ensures that V(Jˉx;xt)≤0 and V(Jˉx;xt)=0. This equality ensures that xt=ˉx, thus ending the proof of the uniqueness and the proof of property (3) is achieved.
In this section, we assume that X is a p-uniformly convex and q-uniformly smooth Banach space. That is, there exists a constant c>0 such that
δX(ϵ)≥cϵp( respectively ρX(t)≤ctq), |
where δX is the moduli of convexity of X, and ρX is the moduli of smoothness of X, given respectively by
δX(ϵ)=inf{1−‖x+y2‖:‖x‖=‖y‖=1 and ‖x−y‖=ϵ},0≤ϵ≤2 |
and
ρX(t)=sup{12(‖x+y‖+‖x−y‖)−1:‖x‖=1,‖y‖=t},t>0. |
For more details and properties of p-uniformly convex and q-uniformly smooth Banach space, we refer the reader to books [1,17].
Let F:X→→X∗ be a set-valued mapping, f:X→R∪{∞} be a l.s.c. function (not necessarily convex), and let S⊂X be a nonempty closed set not necessarily convex. First, we define the following set:
Nf,λS(x):={x∗∈X∗: such that x∈πf,λS(J(x)+λx∗)}. |
Our aim is to use the main result in the previous section to study the following nonconvex variational problem:
Find ˉx∈S such that Nf,λS(ˉx)∩[−F(ˉx)]≠∅. | (4.1) |
This variational problem can be seen as a variant of the following nonconvex variational problem
Find ˉx∈S such that NPS(ˉx)∩[−F(ˉx)]≠∅, | (4.2) |
where NPS(ˉx) is the proximal normal cone associated with S at ˉx. This problem, denoted as (4.2), has been introduced and studied in [8] for prox-regular sets in the Hilbert space setting. When f=0, it is easy to check that any solution of (4.2) is also a solution of (4.1) for some λ>0. Conversely, for any λ>0, any solution of (4.1) is a solution of (4.2). If, in addition, S is assumed to be convex, then both variational problems (4.2) and (4.1) coincide. Since the work in [8], numerous other works have explored and extended, in various ways, the existence of solutions for (4.2) (see [5,9,10,15,18] and the references therein). Furthermore, the variational problem (4.2) can be viewed as a reformulation of the well-known generalized equilibrium problem:
Find ˉx∈S such that 0∈F(ˉx)+NS(ˉx), | (4.3) |
which is an extension of the equilibrium problems involving set-valued mappings overs closed sets (see, for instance, [4,12,16]). Consequently, our proposed variational problem (4.1) can be considered an appropriate extension of both (4.2) and (4.3).
First, we show that in the convex case, the variational problem (4.1) coincides with the usual variational inequality:
Find ˉx∈S and y∗∈F(ˉx) such that ⟨y∗,y−ˉx⟩+f(y)−f(ˉx)≥0,∀y∈S. | (4.4) |
The variational inequality (4.4) is well studied in the convex case in [2,3,13,14].
Proposition 4.1. Whenever S is a closed convex set and f is a l.s.c. convex function, we have (4.1) ⟺ (4.4).
Proof. It is enough to prove that the set Nf,λS(ˉx) can be characterized in the convex case as
Nf,λS(ˉx)={x∗∈X∗: such that ⟨x∗,x−ˉx⟩+f(ˉx)−f(x)≤0,∀x∈S}. |
First, we prove that the set Nf,λS(ˉx) is a subset of the righthand side of the above equality. Let x∗∈Nf,λS(ˉx), then by definition of Nf,λS(ˉx), we have ˉx∈πf,λS(J(ˉx)+λx∗). That is,
eVλ,Sf(J(ˉx)+λx∗)=GVλ,f(J(ˉx)+λx∗,ˉx), |
then
f(ˉx)+12λV(J(ˉx)+λx∗,ˉx)≤f(y)+12λV(J(ˉx)+λx∗,y),∀y∈S. |
Hence,
f(ˉx)−f(y)≤12λ[V(J(ˉx)+λx∗,y)−V(J(ˉx)+λx∗,ˉx)]≤12λ[2⟨λx∗;ˉx−y⟩+V(J(ˉx),y)]≤⟨x∗;ˉx−y⟩+12λV(J(ˉx),y),∀y∈S. |
Let any x∈S and any t∈(0,1), then by convexity of S, we have that the point y:=ˉx+t(x−ˉx) belongs to S. Thus,
⟨x∗;t(x−ˉx)⟩≤f(ˉx+t(x−ˉx))−f(ˉx)+12λV(J(ˉx),ˉx+t(x−ˉx)). |
Using the convexity of f on S to write
⟨x∗;t(x−ˉx)⟩≤(1−t)f(ˉx)+tf(x)−f(ˉx)+12λV(J(ˉx),ˉx+t(x−ˉx))≤t[f(x)−f(ˉx)]+12λV(J(ˉx),ˉx+t(x−ˉx)), |
and by dividing by t and taking the limit when t↓0, we obtain
⟨x∗;x−ˉx⟩≤f(x)−f(ˉx)+12λlimt↓0t−1[V(J(ˉx),ˉx+t(x−ˉx))−V(J(ˉx),ˉx))]. |
Using the differentiability of V with respect to the second variable and ∇xV(z∗,x)=2(J(x)−z∗), we obtain
limt↓0t−1[V(J(ˉx),ˉx+t(x−ˉx))−V(J(ˉx),ˉx))]=⟨∇xV(J(ˉx),ˉx);x−ˉx⟩=⟨2(J(ˉx)−J(ˉx);x−ˉx⟩=0. |
Therefore, we get
⟨x∗;x−ˉx⟩≤f(x)−f(ˉx),∀x∈S. |
Conversely, let x∗∈X∗ satisfy the last inequality, then
f(ˉx)−f(x)≤⟨x∗;ˉx−x⟩≤⟨x∗;ˉx−x⟩+12λV(J(ˉx),x)≤12λ[V(J(ˉx),x)−2⟨λx∗;x−ˉx⟩]≤12λ[V(J(ˉx)+λx∗,x)−V(J(ˉx)+λx∗,ˉx)],∀x∈S. |
This gives
GVλ,f(J(ˉx)+λx∗,ˉx)=eVλ,Sf(J(ˉx)+λx∗), |
which means that ˉx∈πλ,fS(J(ˉx)+λx∗) and, hence, by definition of the set Nf,λS(ˉx), we obtain x∗∈Nf,λS(ˉx), and the proof is complete.
Remark 4.1. When the set-valued mapping F is defined as F(x)=Ax−ξ with A:X→X∗ and ξ∗∈X∗, the proposed variational problem in the convex case (4.4) corresponds to the following well known and well studied convex variational inequality (see, for instance, [2,13,14] and the references therein):
Find ˉx∈S such that ⟨Aˉx−ξ,y−ˉx⟩+f(y)−f(ˉx)≥0,∀y∈S. | (4.5) |
We suggest the following algorithm to solve the proposed nonconvex variational problem (4.1) under some natural and appropriate assumptions on S, f, and F.
Algorithm 1. Let δn↓0 with δ0 be too small.
● Select x0∈S, y∗0∈F(x0) and λ>0;
● For n≥0,
– Compute zn+1:=J∗(J(xn)−λy∗n);
– Choose un+1∈J∗(J(zn+1)+δnB∗) with πf,λS(J(un+1))≠∅;
– Choose xn+1:=πS(J(un+1)) and y∗n+1∈F(xn+1).
Since S and f are not necessarily convex, the (f,λ)-generalized projection πf,λS does not exist necessarily for any x∗∈X∗∖J(S) (see Example 2.1). However, our previous algorithm is well defined, as we will prove in the following proposition.
Proposition 4.2. Assume that X is uniformly convex and uniformly smooth Banach space. The above algorithm is well defined.
Proof. Let n≥0 and xn∈S with y∗n∈F(xn). The point zn+1 is well defined since J and J∗ are well defined and one-to-one, because the space X is assumed to be uniformly convex and uniformly smooth. Now, since the (f,λ)-generalized projection of J(zn+1) is not ensured, we use our main result in Theorem 2.1 to choose some point J(un+1)∈X∗ too close to J(zn+1) so that ‖J(zn+1)−J(un+1)‖≤δn and πf,λS(J(un+1)) is singleton. So, we take xn+1:=πf,λS(J(un+1)), and then we are done.
After proving the well definedness of the algorithm without any additional assumptions on λ, S, f, and F, we add some natural assumptions on the data to prove the convergence of the sequence {xn}n to a solution of (4.1).
In our analysis, we need the following assumptions on S, f, and F:
Assumptions A:
(1) The set S is compact;
(2) F is bounded on S by some constant L>0;
(3) F has a closed graph on S. That is, for any convergent sequence {(xn,y∗n)}n in gph F the graph of F with xn∈S, we have the limit (ˉx,ˉy∗):=limn(xn,y∗n) stays in gph F;
(4) There exists some constant μ>0 and ξ>0 such that
‖πf,λS(u∗1)−πf,λS(u∗2)‖≤ξ‖u∗1−u∗2‖, for all u∗1,u∗2∈J(S)+μB∗; |
(5) The constants μ, δ0, and λ satisfy:
0<δ0<μ and λ<μ−δ0L. |
Theorem 4.1. Let {xn}n be a sequence generated by Algorithm 1. Assume that the assumptions A are satisfied, then there exists a subsequence of {xn}n converging to a solution of (4.1).
Proof. By compactness of the set S and the construction of the sequence (xn)n, there exists a subsequence (xnk) converging to some point ˉx∈S. We have to prove that ˉx is a solution of (4.1). That is, −F(ˉx)∩Nf,λ(ˉx)≠∅, meaning there exists ˉy∗∈F(ˉx) such that −ˉy∗∈Nf,λS(ˉx), i.e., ˉx∈πf,λS(J(ˉx)−λˉy∗). Set ˉz:=J∗(J(ˉx)−λˉy∗). By construction, we have xnk+1=πf,λS(J(unk+1)). By closedness of the graph of F in (4), we obtain easily that the sequence {y∗nk}k is convergent to some limit ˉy∗ belonging to F(ˉx). Also, the continuity of J and J∗ ensure that the subsequence (znk)k converges to ˉz:=J∗(J(ˉx)−λˉy∗). Also, by construction we have
‖J(unk+1)−J(ˉz)‖≤‖J(unk+1)−J(znk+1)‖+‖J(znk+1)−J(ˉz)‖≤δnk−1+‖J(znk+1)−J(ˉz)‖→0, |
which ensures that the subsequence (J(unk))k converges to J(ˉz). Now, we have to prove that (J(un))n and ˉx belong to J(S)+μB. Using the choice of λ and the assumptions on the constants L,δ0 and μ, we can write
dJ(S)(J(un))≤dJ(S)(J(zn))+‖J(un)−J(zn)‖≤λ‖y∗n−1‖+δn−1<λL+δ0<μ |
and
dJ(S)(J(ˉz))=dJ(S)(J(ˉx)−λˉy∗)≤λ‖ˉy∗‖<λL<μ, |
which ensure that J(un) and J(ˉz) belong to J(S)+μB∗. Using the Lipschitz continuity of the (f,λ)-generalized projection on J(S)+μB∗ we can write
‖πf,λS(J(ˉz))−ˉx‖=‖πf,λS(J(ˉz))−πf,λS(J(unk+1))+xnk+1−ˉx‖≤‖πf,λS(J(ˉz))−πf,λS(J(unk+1))‖+‖xnk+1−ˉx‖≤ξ‖J(unk+1)−J(ˉz)‖+‖xnk+1−ˉx‖→0. |
This ensures that ˉx=πf,λS(J(ˉz))=πf,λS(J(ˉx)−λˉy∗), which ensures by definition of the set Nf,λS(ˉx) that
−ˉy∗∈Nf,λS(ˉx). |
Thus,
Nf,λS(ˉx)∩[−F(ˉx)]≠∅; |
that is, ˉx is a solution of (4.1), thus completing the proof.
Example 4.1. Assume that X is p-uniformly smooth and 2-uniformly convex space (for instance, X=Lp with p∈(1,2]), and consider the following nonconvex variational inequality: Find ˉx∈S and y∗∈F(ˉx) such that
⟨y∗,ˉx−y⟩+f(y)−f(ˉx)≥−12λV(J(ˉx),y),∀y∈S, | (4.6) |
where S is given by S:=A2∪(A2+x0) and f=ψA with A:=A1∪(A1+x0). Assume that A1 and A2 are two closed convex sets with A1∩A2=B (i.e., their intersection is the unit ball), and assume that x0 is very far from both sets A1 and A2 so that A2∩(A2+x0)=∅ and A1∩(A1+x0)=∅. We assume, for instance, that ‖x0‖≥2diam(A1∪A2). Assume that the set A2 is compact, then by Theorem 4.1, the noncovex variational inequality (4.6) admits a solution as a limit of a subsequence of the sequence generated by Algorithm 1.
Proof. To do that, we have to prove that all the assumptions of Theorem 4.1 are fulfilled. First, we need to check the two following equalities:
{A∩S=B∪(B+x0),πf,λS(x∗)=πA∩S(x∗),∀x∗∈X∗. |
The first equality follows directly from our assumption on x0 and some simple computations. To prove the second equality, we take x∗∈X∗ and any λ>0 and let ˉx∈πf,λS(x∗). Then, ˉx∈S with
f(ˉx)+12λV(x∗;ˉx)≤f(y)+12λV(x∗,y),∀y∈S. |
This inequality ensures that ˉx has to be in A and, hence, ˉx∈A∩S with
12λV(x∗;ˉx)≤f(y)+12λV(x∗,y),∀y∈S. |
Since λ>0, we deduce that
V(x∗;ˉx)≤V(x∗,y),∀y∈A∩S. |
This ensures by definition that ˉx∈πA∩S(x∗). In a similar way, we prove the converse direction.
Now, we recall two results from [7].
(1) Example 4.10 in [7]. The set B∪(B+x0) with ‖x0‖>3 is a closed nonempty nonconvex set that is uniformly generalized prox-regular for some positive constant r>0 in the sense of [7].
(2) Theorem 4.4 in [7]. If X is q-uniformly convex and K is a bounded set, which is uniformly generalized prox-regular for some positive constant r>0, then there exists some r′∈(0,r) and γ>0 such that
‖πK(x∗)−πK(y∗)‖≤γ‖x∗−y∗‖1q−1,∀x∗,y∗∈UVK(r′). |
Here, UVK(r′):={x∗∈X∗:infy∈KV(x∗,y)≤r′2}.
Since the space X∗ is 2-uniformly smooth, there exists some α>0 such that V(x∗,y)≤α‖x∗−J(y)‖2,∀y∈S. Here, α depends only on S and the space X∗. Choose μ∈(0,r′√α), then for any x∗∈J(S)+μB∗ we have
infs∈SV(x∗,s)≤αinfs∈S‖x∗−J(s)‖2≤αμ2<r′2; |
that is, x∗∈UVS(r′). Combining now the above results (1) and (2), we have A∩S=B∪(B+x0) is bounded uniformly generalized prox-regular for some r>0, and so there exists r′∈(0,r) such that πA∩S is Lispchitz continuous on UVA∩S(r′), and in particular on J(S)+μB∗ for some μ>0. Therefore, all the assumptions of Theorem 4.1 are satisfied, and so the sequence generated by Algorithm 1 admits a subsequence converging to a solution of the nonconvex variational inequality (4.6).
Remark 4.2. It is very important to mention that the existence of solution of (4.6) cannot be obtained by any other existence results due to the nonconvexity of all the data of the considered problem, the set S and the function f.
The author declares they have not used Artificial Intelligence (AI) tools in the creation of this article.
The author extends his appreciations to Researchers Supporting Project number (RSPD2023R1001), King Saud University, Riyadh, Saudi Arabia.
The author declares that they have no conflict of interests.
[1] | Y. Alber, I. Ryazantseva, Nonlinear Ill-posed problems of monotone type, Dordrecht: Springer, 2006. http://dx.doi.org/10.1007/1-4020-4396-1 |
[2] | Y. Alber, Generalized projection operators in Banach spaces: properties and applications, arXiv: funct-an/9311002. |
[3] | Y. Alber, Metric and generalized projection operators in Banach spaces: properties and applications, arXiv: funct-an/9311001. |
[4] | H. Ben-El-Mechaiekh, W. Kryszewski, Equilibria of set-valued maps on nonconvex domains, Trans. Amer. Math. Soc., 349 (1997), 4159–4179. |
[5] | M. Bounkhel, Regularity concepts in nonsmooth analysis, theory and applications, New York: Springer, 2012. http://dx.doi.org/10.1007/978-1-4614-1019-5 |
[6] |
M. Bounkhel, generalized Projections on closed nonconvex sets in uniformly convex and uniformly smooth Banach spaces, J. Funct. Space., 2015 (2015), 478437. http://dx.doi.org/10.1155/2015/478437 doi: 10.1155/2015/478437
![]() |
[7] |
M. Bounkhel, M. Bachar, Generalized prox-regularity in reflexive Banach spaces, J. Math. Anal. Appl., 475 (2019), 699–729. http://dx.doi.org/10.1016/j.jmaa.2019.02.064 doi: 10.1016/j.jmaa.2019.02.064
![]() |
[8] | M. Bounkhel, L. Tadj, A. Hamdi, Iterative schemes to solve nonconvex variational problems, Journal of Inequalities in Pure and Applied Mathematics, 4 (2003), 1–14. |
[9] |
M. Bounkhel, Dj. Bounekhel, Iterative schemes for nonconvex quasi-variational problems with V-prox-regular data in Banach spaces, J. Funct. Space., 2017 (2017), 8708065. http://dx.doi.org/10.1155/2017/8708065 doi: 10.1155/2017/8708065
![]() |
[10] |
J. Chen, A. Pitea, L. Zhu, Split systems of nonconvex variational inequalities and fixed point problems on uniformly prox-regular sets, Symmetry, 11 (2019), 1279. http://dx.doi.org/10.3390/sym11101279 doi: 10.3390/sym11101279
![]() |
[11] | F. Clarke, Y. Ledyaev, R. Stern, R. Wolenski, Nonsmooth analysis and control theory, New York: Springer-Verlag, 1998. http://dx.doi.org/10.1007/b97650 |
[12] |
F. Clarke, Y. Ledyaev, R. Stern, Fixed points and equilibria in nonconvex sets, Nonlinear Anal.-Theor., 25 (1995), 145–161. http://dx.doi.org/10.1016/0362-546X(94)00215-4 doi: 10.1016/0362-546X(94)00215-4
![]() |
[13] |
J. Li, The generalized projection operator on reflexive Banach spaces and its applications, J. Math. Anal. Appl., 306 (2005), 55–71. http://dx.doi.org/10.1016/j.jmaa.2004.11.007 doi: 10.1016/j.jmaa.2004.11.007
![]() |
[14] |
J. Li, On the existence of solutions of variational inequalities in Banach spaces, J. Math. Anal. Appl., 295 (2004), 115–126. http://dx.doi.org/10.1016/j.jmaa.2004.03.010 doi: 10.1016/j.jmaa.2004.03.010
![]() |
[15] |
M. Noor, On an implicit method for nonconvex variational inequalities, J. Optim. Theory Appl., 147 (2010), 411–417. http://dx.doi.org/10.1007/s10957-010-9717-y doi: 10.1007/s10957-010-9717-y
![]() |
[16] | R. Tyrrell Rockafellar, R. Wets, Variational analysis, Berlin: Springer-Verlag, 1998. http://dx.doi.org/10.1007/978-3-642-02431-3 |
[17] | W. Takahashi, Nonlinear functional analysis, Yokohama: Yokohama Publishers, 2000. |
[18] |
D. Wen, Projection methods for a generalized system of nonconvex variational inequalities with different nonlinear operators, Nonlinear Anal.-Theor., 73 (2010), 2292–2297. http://dx.doi.org/10.1016/j.na.2010.06.010 doi: 10.1016/j.na.2010.06.010
![]() |
[19] |
K. Wu, N. Huang, The generalized f-projection operator with an application, Bull. Austral. Math. Soc., 73 (2006), 307–317. http://dx.doi.org/10.1017/S0004972700038892 doi: 10.1017/S0004972700038892
![]() |
[20] |
K. Wu, N. Huang, Properties of the generalized f-projection operator and its application in Banach spaces, Comput. Math. Appl., 54 (2007), 399–406. http://dx.doi.org/10.1016/j.camwa.2007.01.029 doi: 10.1016/j.camwa.2007.01.029
![]() |
1. | Messaoud Bounkhel, V-Moreau envelope of nonconvex functions on smooth Banach spaces, 2024, 9, 2473-6988, 28589, 10.3934/math.20241387 | |
2. | Messaoud Bounkhel, Quasi-Lower C2 Functions and Their Application to Nonconvex Variational Problems, 2024, 13, 2075-1680, 870, 10.3390/axioms13120870 |