Research article

A modified proximal point algorithm in geodesic metric space

  • Received: 27 July 2022 Revised: 18 November 2022 Accepted: 23 November 2022 Published: 05 December 2022
  • MSC : 47H09, 47H10

  • Proximal point algorithm is one of the most popular technique to find either zero of monotone operator or minimizer of a lower semi-continuous function. In this paper, we propose a new modified proximal point algorithm for solving minimization problems and common fixed point problems in CAT(0) spaces. We prove Δ and strong convergence of the proposed algorithm. Our results extend and improve the corresponding recent results in the literature.

    Citation: Chanchal Garodia, Izhar Uddin, Bahaaeldin Abdalla, Thabet Abdeljawad. A modified proximal point algorithm in geodesic metric space[J]. AIMS Mathematics, 2023, 8(2): 4304-4320. doi: 10.3934/math.2023214

    Related Papers:

    [1] Sani Salisu, Vasile Berinde, Songpon Sriwongsa, Poom Kumam . Approximating fixed points of demicontractive mappings in metric spaces by geodesic averaged perturbation techniques. AIMS Mathematics, 2023, 8(12): 28582-28600. doi: 10.3934/math.20231463
    [2] Chainarong Khunpanuk, Chanchal Garodia, Izhar Uddin, Nuttapol Pakkaranang . On a proximal point algorithm for solving common fixed point problems and convex minimization problems in Geodesic spaces with positive curvature. AIMS Mathematics, 2022, 7(5): 9509-9523. doi: 10.3934/math.2022529
    [3] Sani Salisu, Poom Kumam, Songpon Sriwongsa . One step proximal point schemes for monotone vector field inclusion problems. AIMS Mathematics, 2022, 7(5): 7385-7402. doi: 10.3934/math.2022412
    [4] Moosa Gabeleh, Elif Uyanık Ekici, Manuel De La Sen . Noncyclic contractions and relatively nonexpansive mappings in strictly convex fuzzy metric spaces. AIMS Mathematics, 2022, 7(11): 20230-20246. doi: 10.3934/math.20221107
    [5] Areerat Arunchai, Thidaporn Seangwattana, Kanokwan Sitthithakerngkiet, Kamonrat Sombut . Image restoration by using a modified proximal point algorithm. AIMS Mathematics, 2023, 8(4): 9557-9575. doi: 10.3934/math.2023482
    [6] Umar Ishtiaq, Fahad Jahangeer, Doha A. Kattan, Manuel De la Sen . Generalized common best proximity point results in fuzzy multiplicative metric spaces. AIMS Mathematics, 2023, 8(11): 25454-25476. doi: 10.3934/math.20231299
    [7] Arshad Ali Khan, Basit Ali, Reny George . On semi best proximity points for multivalued mappings in quasi metric spaces. AIMS Mathematics, 2023, 8(10): 23835-23849. doi: 10.3934/math.20231215
    [8] P. Dhivya, D. Diwakaran, P. Selvapriya . Best proximity points for proximal Górnicki mappings and applications to variational inequality problems. AIMS Mathematics, 2024, 9(3): 5886-5904. doi: 10.3934/math.2024287
    [9] Naeem Saleem, Hüseyin Işık, Sana Khaleeq, Choonkil Park . Interpolative Ćirić-Reich-Rus-type best proximity point results with applications. AIMS Mathematics, 2022, 7(6): 9731-9747. doi: 10.3934/math.2022542
    [10] Khalil Javed, Muhammad Nazam, Fahad Jahangeer, Muhammad Arshad, Manuel De La Sen . A new approach to generalized interpolative proximal contractions in non archimedean fuzzy metric spaces. AIMS Mathematics, 2023, 8(2): 2891-2909. doi: 10.3934/math.2023151
  • Proximal point algorithm is one of the most popular technique to find either zero of monotone operator or minimizer of a lower semi-continuous function. In this paper, we propose a new modified proximal point algorithm for solving minimization problems and common fixed point problems in CAT(0) spaces. We prove Δ and strong convergence of the proposed algorithm. Our results extend and improve the corresponding recent results in the literature.



    Let (X,d) be a geodesic metric space and f:X(,] be a proper and convex function. One of the major problem in optimization is to find xX such that

    f(x)=minyXf(y). (1.1)

    We denote by

    argminyXf(y),

    the set of a minimizer of a convex function. One of the most effective way of solving problem (1.1) is the Proximal Point Algorithm (for short term, PPA). Its origin goes back to Martinet [1], Rockafellar [2], and Brézis and Lions [3]. Martinet studied the PPA for variational inequalities whereas Rockafellar showed the weak convergence of the sequence generated by the proximal point algorithm to a zero of the maximal monotone operator in Hilbert spaces. Güler's counterexample [4] showed that the sequence generated by the proximal point algorithm does not necessarily converge strongly even if the maximal monotone operator is the subdifferential of a convex, proper, and lower semicontinuous function. Kamimura and Takahashi [5] combined the PPA with Halpern's algorithm [6] so that the strong convergence is guaranteed. The proximal point algorithm can be used in numerous problems such as equilibrium problems, saddle point problems, convex minimization problems, and variational inequality problems.

    Recently, many convergence results for the PPA for solving optimization problems have been extended from the classical linear spaces such as Euclidean spaces, Hilbert spaces and Banach spaces to the setting of manifolds [7,8,9,10]. The minimizers of the objective convex functionals in the spaces with nonlinearity play a crucial role in the branch of analysis and geometry. Numerous applications in computer vision, machine learning, electronic structure computation, system balancing and robot manipulation can be considered as solving optimization problems on manifolds [11,12,13,14].

    In 2014, Bačák [15] obtained few results using the proximal point algorithm in CAT(0) spaces. Also, he employed a splitting version of the PPA to find minimizer of a sum of convex functions, thereby extending the results of Bertsekas [16] into Hadamard spaces. Following this, many mathematicians have obtained numerous results involving the proximal point algorithm in the framework of CAT(0) spaces [17,18,19,20,21,27,28]. It is worth mentioning here that approximating the common fixed points has its own importance as it has a direct link with the minimization problems. Takahashi [22] and Izhar Uddin et al. [23] has applied common fixed point approximation to solve split feasibility and optimization problem. In 2020, Dung and Hieu [24] and Yambangwai et al. [25] studied approximating fixed points of three mappings and applied their results for image debluggring. Very recently, Yambangwai and Thianwan [26] applied approximating fixed points of three mappings into mage deblurring and signal recovering problems. They also showed that results involving three mappings are better than the results involving one or two mappings.

    Fascinated by the ongoing research, in this paper, we propose a new modified proximal point algorithm for finding a common element of the set of fixed points of three single-valued nonexpansive mappings, the set of fixed points of three multi-valued nonexpansive mappings and the set of minimizers of convex and lower semi-continuous functions. We prove few convergence results for the proposed algorithm under some mild conditions.

    In this section, we present some fundamental concepts, definitions, and some results, which will be used in the next section.

    A metric space (X,d) is said to be a CAT(0) space if it is geodesically connected, and if every geodesic triangle in X is at least as thin as its comparison triangle in the Euclidean plane (see more details in [29]). A complete CAT(0) space is then called a Hadamard space. Euclidean spaces, Hilbert spaces, the Hilbert ball [30], hyperbolic spaces [31], R-tress [32] and a complete, simply connected Riemannian manifold having non-positive sectional curvature are some examples of a CAT(0) space.

    Definition 1. A subset D of a CAT(0) space X is said to be convex if D includes every geodesic segment joining ant two of its points, that is, for any x,yD, we have [x,y]D, where [x,y]:={αx(1α)y:0α1} is the unique geodesic joining x and y.

    Definition 2. A single-valued mapping T:DD is said to be

    (ⅰ) nonexpansive if d(Tx,Ty)d(x,y) for all x,yD;

    (ⅱ) semi-compact if for any sequence {xn} in D such that

    limnd(Txn,xn)=0,

    there exist a subsequence {xni} of {xn} such that {xni} converges strongly to xD.

    We denote the set of all fixed points of T is denoted by F(T). Now, we state the following lemma to be used later on.

    Lemma 1. ([33]) Let (X,d) be a CAT(0) space, then the following assertions hold:

    (ⅰ) For x,yX and t[0,1], there exists a unique z[x,y] such that

    d(x,z)=td(x,y)andd(y,z)=(1t)d(x,y).

    (ⅱ) For x,y,zX and t[0,1], we have

    d((1t)xty,z)(1t)d(x,z)+td(y,z)

    and

    d2((1t)xty,z)(1t)d2(x,z)+td2(y,z)t(1t)d2(x,y).

    We use the notation (1t)xty for the unique point z of the above lemma.

    Now, we collect some basic geometric properties which are instrumental throughout the discussions.

    Let {xn} be a bounded sequence in a complete CAT(0) space X. For xX we write:

    r(x,{xn})=lim supnd(x,xn).

    The asymptotic radius r({xn}) is given by

    r({xn})=inf{r(x,xn):xX}

    and the asymptotic center A({xn}) of {xn} is defined as:

    A({xn})={xX:r(x,xn)=r({xn})}.

    It is well known that, in a complete CAT(0) space, A({xn}) consists of exactly one point [34]. We now present the definition and some basic properties of the Δ-convergence which will be fruitful for our subsequent discussion.

    Definition 3. ([35]) A sequence {xn} in a CAT(0) space X is said to be Δ-convergent to a point xX if x is the unique asymptotic center of {un} for every subsequence {un} of {xn}. In this case, we write Δlimnxn=x and call x the Δ-limit of {xn}.

    Lemma 2. ([35]) Every bounded sequence in a complete CAT(0) space admits a Δ-convergent subsequence.

    Lemma 3. ([36]) If D is a closed convex subset of a complete CAT(0) space X and if {xn} is a bounded sequence in D, then the asymptotic center of {xn} is in D.

    Lemma 4. ([33]) Let D be a nonempty closed convex subset of a complete CAT(0) space (X,d) and T:DD be a nonexpansive mapping. If {xn} is a bounded sequence in D such that Δlimnxn=x and limnd(Txn,xn)=0, then x is a fixed point of T.

    Lemma 5. ([33]) If {xn} is a bounded sequence in a complete CAT(0) space with A({xn})={x}, {un} is a subsequence of {xn} with A({un})={u} and the sequence {d(xn,u)} converges, then x=u.

    Lemma 6. ([23,37]) Let D be a nonempty closed and convex subset of a CAT(0) space X. Then, for any {xi}ni=1D and αi(0,1), i=1,2,...,n with ni=1αi=1, we have the following inequalities:

    d(ni=1αixi,z)ni=1αid(xi,z),zD (2.1)

    and

    d2(ni=1αixi,z)ni=1αid2(xi,z)ni,j=1,ijαiαjd2(xi,xj),zD. (2.2)

    Convex and lower semi-continuous functions on CAT(0) spaces are our principal object of interest in this paper. Recall that a function f:D(,] defined on a convex subset D of a CAT(0) space is convex if, for any geodesic γ:[a,b]D, the function foγ is convex, i.e., f(αx(1α)y)αf(x)+(1α)f(y) for all x,yD. For some important examples one can refer [38]. Now, a function f defined on D is said to be lower semi-continuous at xD if

    f(x)liminfnf(xn)

    for each sequence {xn} such that xnx as n. A function f is said to be lower semi-continuous on D if it is lower semi-continuous at any point in D.

    For any λ>0, define the Moreau-Yosida resolvent of f in CAT(0) space as follows:

    Jλ(x)=argminyD[f(y)+12λd2(y,x)]

    for all xD. The mapping Jλ is well defined for all λ0, see [4]. If f is a proper, convex and lower semi-continuous function, then the set F(Jλ) of the fixed point of the resolvent Jλ associated with f coincides with the set argminyDf(y) of minimizers of f; refer [38]. Also, for any λ>0, the resolvent Jλ of f is nonexpansive, see [39].

    Lemma 7. ([40]) Let (X,d) be a complete CAT(0) space and f:X(,] be a proper, convex and lower semi-continuous function, then for all x,yX and λ>0, we have

    12λd2(Jλx,y)12λd2(x,y)+12λd2(x,Jλx)+f(Jλx)f(y).

    Lemma 8. ([39,41]) Let (X,d) be a complete CAT(0) space and f:X(,] be a proper, convex and lower semi-continuous function. Then the following identity holds:

    Jλx=Jμ(λμλJλxμλx)

    for all xX and λ>μ>0.

    Let CB(D), CC(D) and KC(D) denote the families of nonempty closed bounded subsets, closed convex subsets and compact convex subsets of D, respectively. The Pompeiu-Hausdorff distance [42] on CB(D) is defined by

    H(A,B)=max{supxAdist(x,B),supyBdist(y,A)}

    for A,BCB(D), where dist(x,D)=inf{d(x,y):yD} is the distance from a point x to a subset D. An element xD is said to be a fixed point of a multi-valued mapping S:DCB(D) if xSx. We denote the set of all fixed points of S by F(S).

    Definition 4. A multi-valued mapping S:DCB(D) is said to be

    (ⅰ) nonexpansive if H(Sx,Sy)d(x,y) for all x,yD;

    (ⅱ) hemi-compact if for any sequence {xn} in D with limndist(Sxn,xn)=0, there exist a subsequence {xni} of {xn} such that {xni} converges strongly to xD.

    Theorem 1. Let D be a nonempty closed and convex subset of a complete CAT(0) space X. Let Ti:DD, i=1,2,3 be single-valued nonexpansive mappings, Si:DCB(D), i=1,2,3 be multi-valued nonexpansive mappings and g:D(,] be a proper convex and lower semi-continuous function. Suppose that Ω=F(T1)F(T2)F(T3)F(S1)F(S2)F(S3)argminyD and Siq={q}, i=1,2,3 for qΩ. For x1D, let the sequence {xn} is generated in the following manner:

    {wn=argminyX[f(y)+12λnd2(y,xn)],zn=αnxnβnwnγnwn,yn=ψnxnκnwnϕnT1xn,xn+1=δnxnηnT2xnξnT3yn,forallnN, (3.1)

    where {αn}, {βn}, {γn}, {ψn}, {κn}, {ϕn}, {δn}, {ηn} and {ξn} are sequences in (0,1) such that

    0<a{αn},{βn},{γn},{ψn},{κn},{ϕn},{δn},{ηn},{ξn}b<1,
    αn+βn+γn=1,ψn+κn+ϕn=1,δn+ηn+ξn=1,

    for all nN and {λn} is a sequence such that λnλ>0 for all nN and some λ. Then, the following statements hold:

    (ⅰ) limnd(xn,q) exists for all qΩ;

    (ⅱ) limnd(xn,wn)=0;

    (ⅲ) limndist(xn,Sixn)=0,i=1,2,3;

    (ⅳ) limnd(xn,Tixn)=0,i=1,2,3;

    (ⅴ)limnd(xn,Jλxn)=0.

    Proof. Let qΩ, then

    q=T1q=T2q=T3q(S1qS2qS3q)

    and

    f(q)f(y),yD.

    Therefore, we have

    f(q)+12λnd2(q,q)f(y)+12λnd2(y,q),

    for all yD and hence q=Jλq.

    () Note that wn=Jλnxn and Jλn is nonexpansive map for each nN. So, we have

    d(wn,q)=d(Jλnxn,Jλnq)d(xn,q). (3.2)

    As qSi(q) for i=1,2,3, using (3.2) and Lemma 6 we have

    d(zn,q)=d(αnxnβnwnγnwn,q)αnd(xn,q)+βnd(wn,q)+γnd(wn,q)αnd(xn,q)+βnd(S1xn,S1q)+γnd(S2wn,S2q)d(xn,q) (3.3)

    and

    d(yn,q)=d(ψnxnκnwnϕnT1xn,q)ψnd(xn,q)+κnd(wn,q)+ϕnd(T1xn,q)ψnd(xn,q)+κnd(S3zn,q)+ϕnd(T1xn,q)d(xn,q). (3.4)

    Now, consider

    d(xn+1,q)=d(δnxnηnT2xnξnT3yn,q)δnd(xn,q)+ηnd(T2xn,q)+ξnd(T3yn)d(xn,q). (3.5)

    This shows that limnd(xn,q) exists and so we assume that

    limnd(xn,q)=r0. (3.6)

    () Next, we show that limnd(xn,wn)=0. By Lemma 7, we get

    12λn{d2(wn,q)d2(xn,q)+d2(xn,wn)}f(q)f(wn).

    Since f(p)f(wn) for each nN, it follows that

    d2(xn,wn)d2(xn,q)d2(wn,q). (3.7)

    So, in order to show that limnd(xn,wn)=0, it is sufficient to show that

    limnd(wn,q)=r.

    From (3.3), we have

    lim supnd(zn,q)lim supnd(xn,q)=r. (3.8)

    Also, using (3.4), we get

    lim supnd(yn,q)lim supnd(xn,q)=r. (3.9)

    Using (3.5) along with the fact that δn+ηn+ξn=1 for all n1, we obtain

    d(xn+1,q)δnd(xn,q)+ηnd(T2xn,q)+ξnd(T3yn,q)(1ξn)d(xn,q)+ξnd(yn,q),

    which is same as

    d(xn,q)1ξn[d(xn,q)d(xn+1,q)]+d(yn,q)1a[d(xn,q)d(xn+1,q)]+d(yn,q),

    which gives

    lim infnd(xn,q)lim infn{1a[d(xn,q)d(xn+1,q)]+d(yn,q)}.

    On using (3.6), we get

    rlim infnd(yn,q). (3.10)

    From (3.9) and (3.10), we obtain

    limnd(yn,q)=r. (3.11)

    Similarly, (3.4) yields

    d(yn,q)ψnd(xn,q)+κnd(zn,q)+ϕnd(xn,q)d(xn,q)κnd(xn,q)+κnd(zn,q),

    which results into

    d(xn,q)1κn[d(xn,q)d(yn,q)]+d(zn,q)1a[d(xn,q)d(yn,q)]+d(zn,q),

    which on using (3.6) and (3.11) gives

    rlim infnd(zn,q). (3.12)

    From (3.8) and (3.12), we get

    limnd(zn,q)=r. (3.13)

    Now, on using (3.3), we have

    d(xn,q)1a[d(xn,q)d(zn,q)]+d(wn,q),

    which along with (3.6) and (3.13) gives

    rlim infnd(wn,q). (3.14)

    Also, (3.2) results into

    lim supnd(wn,q)lim supnd(xn,q)=r. (3.15)

    On using (3.14) and (3.15), we obtain

    limnd(wn,q)=r. (3.16)

    From (3.6), (3.7) and (3.16), we get

    limnd(xn,wn)=0. (3.17)

    () Now, we prove limnd(xn,Sixn)=0 for i=1,2,3.

    Consider

    d2(zn,q)=d2(αnxnβnwnγnwn,q)αnd2(xn,q)+βnd2(wn,q)+γnd2(wn,q)αnβnd2(xn,wn)αnγnd2(xn,wn)βnγnd2(wn,wn)d2(xn,q)αnβnd2(xn,wn)αnγnd2(xn,wn)βnγnd2(wn,wn),

    which is equivalent to

    αnβnd2(xn,wn)+αnγnd2(xn,wn)+βnγnd2(wn,wn)d2(xn,q)d2(zn,q).

    On using (3.6) and (3.8), we obtain

    limnd(xn,wn)=0, (3.18)
    limnd(xn,wn)=0, (3.19)

    and

    limnd(wn,wn)=0. (3.20)

    Now, triangle inequality gives

    dist(xn,S1xn)d(xn,wn)+dist(wn,S1xn),

    which on using (3.18) results into

    limndist(xn,S1xn)=0. (3.21)

    Again, consider

    dist(xn,S2xn)d(xn,wn)+dist(wn,S2xn)d(xn,wn)+d(wn,xn),

    which on using (3.17) and (3.19) gives

    limndist(xn,S2xn)=0. (3.22)

    Now, we have

    d2(yn,q)ψnd2(xn,q)+κnd2(wn,q)+ϕnd2(T1xn,q)ψnκnd2(xn,wn)ψnϕnd2(xn,T1xn)κnϕnd2(wn,T1xn)d2(xn,q)ψnκnd2(xn,wn)ψnϕnd2(xn,T1xn)κnϕnd2(wn,T1xn),

    which is equivalent to

    ψnκnd2(xn,wn)+ψnϕnd2(xn,T1xn)+κnϕnd2(wn,T1xn)d2(xn,q)d2(yn,q),

    this on using (3.6) and (3.11) gives

    limnd(xn,wn)=0, (3.23)
    limnd(xn,T1xn)=0, (3.24)

    and

    limnd(T1xn,wn)=0. (3.25)

    On using (3.18) and (3.19), we have

    d(zn,xn)αnd(xn,xn)+βnd(wn,xn)+γnd(wn,xn)0asn. (3.26)

    Thus, with the help of (3.23) and (3.26), we obtain

    dist(xn,S3xn)d(xn,wn)+dist(wn,S3xn)d(xn,wn)+d(zn,xn)0asn. (3.27)

    () Next, we show that

    limnd(xn,T1xn)=limnd(xn,T2xn)=limnd(xn,T3xn)=0.

    In (3.24), we have already proved that limnd(xn,T1xn)=0.

    So, consider

    d2(xn+1,q)d2(xn,q)δnηnd2(xn,T2xn)δnξnd2(xn,T3yn)ηnξnd2(T2xn,T3yn),

    which results into

    limnd(xn,T2xn)=0, (3.28)
    limnd(xn,T3yn)=0, (3.29)

    and

    limnd(T2xn,T3yn)=0. (3.30)

    On using (3.23) and (3.24), we obtain

    d(yn,xn)ψnd(xn,xn)+κnd(wn,xn)+ϕnd(T1xn,xn)0asn. (3.31)

    Now, (3.28), (3.30) and (3.31) yields

    d(xn,T3xn)d(xn,T2xn)+d(T2xn,T3yn)+d(T3yn,T3xn)0asn. (3.32)

    $ () Now,as w_n = J_{\lambda_n} x_{n} $, from Lemma 8 we have

    d(Jλxn,xn)d(Jλxn,wn)+d(wn,xn)=d(Jλxn,Jλnxn)+d(wn,xn)=d(Jλxn,Jλ(λnλλnJλnxnλλnxn))+d(wn,xn)d(xn,(1λλn)Jλnxnλλnxn)+d(wn,xn)(1λλn)d(xn,Jλnxn)+λλnd(xn,xn)+d(wn,xn)=(1λλn)d(xn,wn)+d(wn,xn)0asn.

    We now present the Δ-convergence result in CAT(0) spaces.

    Theorem 2. Let D be a nonempty closed and convex subset of a complete CAT(0) space X. Let Ti:DD, i=1,2,3 be single-valued nonexpansive mappings, Si:DKC(D), i=1,2,3 be multi-valued nonexpansive mappings, and f:D(,] be a proper convex and lower semi-continuous function. Suppose that Ω=F(T1)F(T2)F(T3)F(S1)F(S2)F(S3)argminyD and Siq={q}, i=1,2,3 for qΩ. For x1D, let the sequence {xn} is generated by (3.1), where {αn}, {βn}, {γn}, {ψn}, {κn}, {ϕn}, {δn}, {ηn} and {ξn} are sequences in (0,1) such that

    0<a{αn},{βn},{γn},{ψn},{κn},{ϕn},{δn},{ηn},{ξn}b<1,
    αn+βn+γn=1,ψn+κn+ϕn=1,δn+ηn+ξn=1,

    for all nN and {λn} is a sequence such that λnλ>0 for all nN and some λ. Then, the sequence {xn} Δ-converges to a point in Ω.

    Proof. Let Wω({xn})=A({un}), where union is taken over all subsequences {un} over {xn}. In order to show the Δ-convergence of {xn} to a point of Ω, firstly we will prove Wω({xn})Ω and thereafter argue that Wω({xn}) is a singleton set.

    To show Wω({xn})Ω, let qWω({xn}). Then, there exists a subsequence {un} of {xn} such that A({un})=q. By Lemmas 2 and 3, there exists a subsequence {vn} of {un} such that Δlimnvn=v and vD. From Theorem 1, we have

    limnd(vn,Tivn)=0,i=1,2,3

    and

    limnd(vn,Jλvn)=0.

    Since Ti, i=1,2,3 and Jλ are nonexpansive mappings, with the use of Lemma 4, we obtain

    v=T1v=T2v=T3v=Jλv.

    So, we have

    vF(T1)F(T2)F(T3)argminyDf(y). (3.33)

    Since Si, i=1,2,3 is compact valued, for each nN, there exist rinSivn and pinSiv, i=1,2,3 such that

    d(vn,rin)=dist(vn,Sivn),i=1,2,3,

    and

    d(rin,pin)=dist(rin,Siv),i=1,2,3.

    From Theorem 1, we get

    limnd(vn,rin)=0,i=1,2,3.

    By using the compactness of Siv, i=1,2,3, there exists a subsequence {pinj} of {pin} such that limjpinj=piSiv, i=1,2,3. With the help of Opial condition, we have

    lim supjd(vnj,pi)lim supj(d(vnj,rinj)+d(rinj,pinj)+d(pinj,pi))lim supj(d(vnj,rinj)+dist(rinj,Siv)+d(pinj,pi))lim supj(d(vnj,rinj)+H(Sivnj,Siv)+d(pinj,pi))lim supj(d(vnj,rinj)+d(vnj,v)+d(pinj,pi))=lim supjd(vnj,v).

    Since asymptotic center is unique, we get v=piSiv, i=1,2,3. By using (3.33), we obtain

    vF(T1)F(T2)F(T3)F(S1)F(S2)F(S3)argminyDf(y)=Ω.

    From Theorem 1 and Lemma 5, we get q=v, and Wω({xn})Ω.

    Now it is left to show that Wω({xn}) consists of single element only. For this, let {un} be a subsequence of {xn}. Again, by using Lemma 2, we can find a subsequence {vn} of {un} such that Δlimnvn=v. Let A({un})=u and A({xn})=x. It is enough to show that v=x. Since vΩ, by Theorem 1, {d(xn,v)} is convergent. Again, by Lemma 5, we have v=x which proves that Wω({xn})={x}. Hence the conclusion follows.

    The following results are strong convergence theorems for the proposed algorithm in CAT(0) spaces.

    Theorem 3. Under the hypothesis of Theorem 2, the sequence {xn} converges to an element of Ω if Jλ is semi-compact or T1 is semi-compact or T2 is semi-compact or T3 is semi-compact or S1 is hemi-compact or S2 is hemi-compact or S3 is hemi-compact.

    Proof. Without loss of generality, we assume that S1 is hemi-compact. Therefore, there exist a subsequence {vn} of {xn} which is having a strong limit p in D. From Theorem 1, we get

    limnd(Tiun,un)=0,i=1,2,3,
    limnd(Jλun,un)=0,

    and

    limndist(Siun,un)=0,i=1,2,3.

    From Lemma 4, we obtain

    pF(T1)F(T2)F(T3)argminyDf(y). (3.34)

    By using nonexpansiveness of S1, we have

    dist(p,S1p)d(p,un)+dist(un,S1un)+H(S1un,S1p)2d(p,un)+dist(un,S1un)0asn.

    This results into dist(p,S1p)=0, which is same as pS1p. Thus, pF(S1). Similarly, we can show that pF(S2) and pF(S3). Therefore, from (3.34), we get

    pF(T1)F(T2)F(T3)F(S1)F(S2)F(S3)argminyDf(y)=Ω.

    By using double extract subsequence principle, we get that the sequence {xn} converges strongly to pΩ.

    Since every multi-valued mapping S:DCB(D) is hemi-compact if D is a compact subset of X. So, the following result can be obtained from Theorem 3 immediately.

    Theorem 4. Let D be a nonempty compact and convex subset of a complete CAT(0) space X. Let Ti:DD, i=1,2,3 be single-valued nonexpansive mappings, Si:DKC(D), i=1,2,3 be multi-valued nonexpansive mappings, and f:D(,] be a proper convex and lower semi-continuous function. Suppose that Ω=F(T1)F(T2)F(T3)F(S1)F(S2)F(S3)argminyD and Siq={q}, i=1,2,3 for qΩ. For x1D, let the sequence {xn} is generated by (3.1), where {αn}, {βn}, {γn}, {ψn}, {κn}, {ϕn}, {δn}, {ηn} and {ξn} are sequences in (0,1) such that

    0<a{αn},{βn},{γn},{ψn},{κn},{ϕn},{δn},{ηn},{ξn}b<1,
    αn+βn+γn=1,ψn+κn+ϕn=1,δn+ηn+ξn=1,

    for all nN and {λn} is a sequence such that λnλ>0 for all nN and some λ. Then, the sequence {xn} converges strongly to a point in Ω.

    Remarks:

    (ⅰ) Since any CAT(k) space is a CAT(k) space for kk (refer [29]), all our results immediately apply to any CAT(k) space with k0.

    (ⅱ) Every real Hilbert space H is a complete CAT(0) space, so we have the following convergence results which can be obtained from Theorems 2 and 3.

    Corollary 1. Let D be a nonempty closed and convex subset of a real Hilbert space X. Let Ti:DD, i=1,2,3 be single-valued nonexpansive mappings, Si:DCB(D), i=1,2,3 be multi-valued nonexpansive mappings and g:D(,] be a proper convex and lower semi-continuous function. Suppose that Ω=F(T1)F(T2)F(T3)F(S1)F(S2)F(S3)argminyD and Siq={q}, i=1,2,3 for qΩ. For x1D, let the sequence {xn} is generated in the following manner:

    {wn=argminyX[f(y)+12λnyxn2],zn=αnxn+βnwn+γnwn,yn=ψnxn+κnwn+ϕnT1xn,xn+1=δnxn+ηnT2xn+ξnT3yn,forallnN, (3.35)

    where {αn}, {βn}, {γn}, {ψn}, {κn}, {ϕn}, {δn}, {ηn} and {ξn} are sequences in (0,1) such that

    0<a{αn},{βn},{γn},{ψn},{κn},{ϕn},{δn},{ηn},{ξn}b<1,
    αn+βn+γn=1,ψn+κn+ϕn=1,δn+ηn+ξn=1,

    for all nN and {λn} is a sequence such that λnλ>0 for all nN and some λ. Then, the sequence {xn} Δ-converges to a point in Ω.

    Corollary 2. Let D be a nonempty closed and convex subset of a real Hilbert space X. Let Ti:DD, i=1,2,3 be single-valued nonexpansive mappings, Si:DCB(D), i=1,2,3 be multi-valued nonexpansive mappings, and f:D(,] be a proper convex and lower semi-continuous function. Suppose that Ω=F(T1)F(T2)F(T3)F(S1)F(S2)F(S3)argminyD and Siq={q}, i=1,2,3 for qΩ. For x1D, let the sequence {xn} is generated by (3.35), where {αn}, {βn}, {γn}, {ψn}, {κn}, {ϕn}, {δn}, {ηn} and {ξn} are sequences in (0,1) such that

    0<a{αn},{βn},{γn},{ψn},{κn},{ϕn},{δn},{ηn},{ξn}b<1,
    αn+βn+γn=1,ψn+κn+ϕn=1,δn+ηn+ξn=1,

    for all nN and {λn} is a sequence such that λnλ>0 for all nN and some λ. Then, the sequence {xn} converges to an element of Ω if Jλ is semi-compact or T1 is semi-compact or T2 is semi-compact or T3 is semi-compact or S1 is hemi-compact or S2 is hemi-compact or S3 is hemi-compact.

    In this article, we present a new proximal point algorithm for solving the constrained convex minimization problem as well as the fixed point problem of nonexpansive single-valued and multi-valued mappings in CAT(0) spaces. Theorems 2–4 are the main convergence results of the paper. We also driven some corollaries in the class of Hilbert spaces. Our results extend and improves the corresponding results of Cholamjiak [18], Suantai and Phuengrattana [43], Kumam et al. [44], Weng et al. [45] and Weng et al. [46].

    The authors B. Abdalla and T. Abdeljawad would like to thank Prince Sultan University for paying the article processing charges and for the support through the TAS research lab.

    The authors declare that they have no conflicts of interests.



    [1] B. Martinet, Régularisation d'inéuations variationnelles par approximations successives, Rev. Fr. Inform. Rech. Oper., 4 (1970), 154–158.
    [2] R. T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control Optim., 14 (1977), 877–898. https://doi.org/10.1137/0314056 doi: 10.1137/0314056
    [3] H. Brézis, P. Lions, Produits infinis de résolvantes, Israel J. Math., 29 (1978), 329–345. https://doi.org/10.1007/BF02761171 doi: 10.1007/BF02761171
    [4] O. Güler, On the convergence of the proximal point algorithm for convex minimization, SIAM J. Control Optim., 29 (1991), 403–419. https://doi.org/10.1137/0329022 doi: 10.1137/0329022
    [5] S. Kamimura, W. Takahashi, Approximating solutions of maximal monotone operators in Hilbert spaces, J Approx. Theory, 106 (2000), 226–240. https://doi.org/10.1006/jath.2000.3493 doi: 10.1006/jath.2000.3493
    [6] B. Halpern, Fixed points of nonexpanding maps, Bull. Amer. Math. Soc., 73 (1967), 957–961. https://doi.org/10.1090/S0002-9904-1967-11864-0 doi: 10.1090/S0002-9904-1967-11864-0
    [7] O. P. Ferreira, P. R. Oliveir, Proximal point algorithm on Riemannian manifolds, Optimization, 51 (2002), 257–270. https://doi.org/10.1080/02331930290019413 doi: 10.1080/02331930290019413
    [8] C. Li, G. López, V. Martín-Márquez, Monotone vector fields and the proximal point algorithm on Hadamard manifolds, J. Lond. Math. Soc., 79 (2009), 663–683. https://doi.org/10.1112/jlms/jdn087 doi: 10.1112/jlms/jdn087
    [9] E. A. Papa Quiroz, P. R. Oliveira, Proximal point methods for quasiconvex and convex functions with Bregman distances on Hadamard manifolds, J. Convex Anal., 16 (2009), 49–69.
    [10] J. H. Wang, G. López, Modified proximal point algorithms on Hadamard manifolds, Optimization, 60 (2011), 697–708. https://doi.org/10.1080/02331934.2010.505962 doi: 10.1080/02331934.2010.505962
    [11] R. Adler, J. P. Dedieu, J. Y. Margulies, M. Martens, M. Shub, Newton's method on Riemannian manifolds and a geometric model for human spine, IMA J. Numer. Anal., 22 (2002), 359–390. https://doi.org/10.1093/imanum/22.3.359 doi: 10.1093/imanum/22.3.359
    [12] S. T. Smith, Optimization techniques on Riemannian manifolds, In: A. Bloch, Fields institute communications, American Mathematical Society, Providence, 3 (1994), 113–146.
    [13] C. Udrişte, Convex functions and optimization methods on Riemannian manifolds, Mathematics and its Applications, Vol. 297, Springer Dordrecht, 1994. https://doi.org/10.1007/978-94-015-8390-9
    [14] J. H. Wang, C. Li, Convergence of the family of Euler-Halley type methods on Riemannian manifolds under the γ-condition, Taiwan. J. Math., 13 (2009), 585–606. https://doi.org/10.11650/twjm/1500405357 doi: 10.11650/twjm/1500405357
    [15] M. Bačák, The proximal point algorithm in metric spaces, Israel. J. Math., 194 (2013), 689–701. https://doi.org/10.1007/s11856-012-0091-3 doi: 10.1007/s11856-012-0091-3
    [16] D. P. Bertsekas, Incremental proximal methods for large scale convex optimization, Math Program., 129 (2011), 163–195. https://doi.org/10.1007/s10107-011-0472-0 doi: 10.1007/s10107-011-0472-0
    [17] P. Cholamjiak, A. A. N. Abdou, Y. J. Cho, Proximal point algorithms involving fixed points of nonexpansive mappings in CAT(0) spaces, Fixed Point Theory Appl., 2015 (2015), 227. https://doi.org/10.1186/s13663-015-0465-4 doi: 10.1186/s13663-015-0465-4
    [18] P. Cholamjiak, The modified proximal point algorithm in CAT(0) spaces, Optim. Lett., 9 (2015), 1401–1410. https://doi.org/10.1007/s11590-014-0841-8 doi: 10.1007/s11590-014-0841-8
    [19] M. T. Heydari, S. Ranjbar, Halpern-type proximal point algorithm in complete CAT(0) metric spaces, An. Ştiinţ. Univ. Ovidius Constanta Ser. Mat., 24 (2016), 141–159. https://doi.org/10.1515/auom-2016-0052 doi: 10.1515/auom-2016-0052
    [20] S. Khatoon, W. Cholamjiak, I. Uddin, A modified proximal point algorithm involving nearly asymptotically quasi-nonexpansive mappings, J. Inequal. Appl., 2021 (2021), 83. https://doi.org/10.1186/s13660-021-02618-7 doi: 10.1186/s13660-021-02618-7
    [21] S. Khatoon, I. Uddin, M. Basarir, A modified proximal point algorithm for a nearly asymptotically quasi-nonexpansive mapping with an application, Comput. Appl. Math., 40 (2021), 250. https://doi.org/10.1007/s40314-021-01646-9 doi: 10.1007/s40314-021-01646-9
    [22] W. Takahashi, Iterative methods for approximation of fixed points and their applications, J. Oper. Res. Soc. Jpn., 43 (2000), 87–108. https://doi.org/10.15807/jorsj.43.87 doi: 10.15807/jorsj.43.87
    [23] I. Uddin, J. J. Nieto, J. Ali, One-step iteration scheme for multivalued nonexpansive mappings in CAT(0) spaces, Mediterr. J. Math., 13 (2016), 1211–1225. https://doi.org/10.1007/s00009-015-0531-5 doi: 10.1007/s00009-015-0531-5
    [24] N. V. Dung, N. T. Hieu, Convergence of a new three-step iteration process to common fixed points of three G-nonexpansive mappings in Banach spaces with directed graphs, RACSAM, 114 (2020), 140. https://doi.org/10.1007/s13398-020-00872-w doi: 10.1007/s13398-020-00872-w
    [25] D. Yambangwai, S. Aunruean, T. Thianwan, A new modified three-step iteration method for G-nonexpansive mappings in Banach spaces with a graph, Numer Algor., 84 (2020), 537–565. https://doi.org/10.1007/s11075-019-00768-w doi: 10.1007/s11075-019-00768-w
    [26] D. Yambangwai, T. Thianwan, Convergence point of G-nonexpansive mappings in Banach spaces endowed with graphs applicable in image deblurring and signal recovering problems, Ricerche Mat., 2021. https://doi.org/10.1007/s11587-021-00631-y doi: 10.1007/s11587-021-00631-y
    [27] Y. Kimura, F. Kohsaka, Two modified proximal point algorithms for convex functions in Hadamard spaces, Linear Nonlinear Anal., 2 (2016), 69–86. https://doi.org/10.1186/s13660-018-1713-z doi: 10.1186/s13660-018-1713-z
    [28] I. Uddin, C. Garodia, S. H. Khan, A proximal point algorithm converging strongly to a minimizer of a convex function, Jordan J. Math. Stat., 13 (2020), 659–685. https://doi.org/10.1137/0329022 doi: 10.1137/0329022
    [29] M. Bridson, A. Haefliger, Metric spaces of non-positive curvature, Vol. 319, Springer Berlin, Heidelberg, 1999. https://doi.org/10.1007/978-3-662-12494-9
    [30] K. Goebel, S. Reich, Uniform convexity, hyperbolic geometry, and nonexpansive mappings, New York: Marcel Dekker, 1984.
    [31] U. Kohlenbach, Some logical metatheorems with applications in functional analysis, Trans. Amer. Math. Soc., 357 (2015), 89–128.
    [32] J. Tits, A theorem of Lie-Kolchin for trees, contributions to algebra: a collection of papers dedicated to Ellis Kolchin, New York: Academic Press, 1977.
    [33] S. Dhompongsa, B. Panyanak, On Δ-convergence theorems in CAT(0) spaces, Comput. Math. with Appl., 56 (2008), 2572–2579. https://doi.org/10.1016/j.camwa.2008.05.036 doi: 10.1016/j.camwa.2008.05.036
    [34] S. Dhompongsa, W. A. Kirk, B. Sims, Fixed points of uniformly Lipschitzian mappings, Nonlinear Anal., 65 (2006), 762–772. https://doi.org/10.1016/j.na.2005.09.044 doi: 10.1016/j.na.2005.09.044
    [35] W. A. Kirk, B. Panyanak, A concept of convergence in geodesic spaces, Nonlinear Anal., 68 (2008), 3689–3696. https://doi.org/10.1016/j.na.2007.04.011 doi: 10.1016/j.na.2007.04.011
    [36] S. Dhompongsa, W. A. Kirk, B. Panyanak, Nonexpansive set-valued mappings in metric and Banach spaces, J. Nonlinear Convex Anal., 65 (2007), 35–45.
    [37] S. Dhompongsa, A. Kaewkhao, B. Panyanak, On Kirk's strong convergence theorem for multivalued nonexpansive mappings on CAT(0) spaces, Nonlinear Anal., 75 (2012), 459–468. https://doi.org/10.1016/j.na.2011.08.046 doi: 10.1016/j.na.2011.08.046
    [38] D. Ariza-Ruiz, L. Leuştean, G. López, Firmly nonexpansive mappings in classes of geodesic spaces, Trans. Amer. Math. Soc., 366 (2014), 4299–-4322.
    [39] J. Jost, Convex functionals and generalized harmonic maps into spaces of nonpositive curvature, Comment. Math. Helv., 70 (1995), 659–673. https://doi.org/10.1007/BF02566027 doi: 10.1007/BF02566027
    [40] L. Ambrosio, N. Gigli, G. Savare, Gradient flows in metric spaces and in the space of probability measures, 2 Eds., Birkhäuser, Basel, 2008.
    [41] U. F. Mayer, Gradient flows on nonpositively curved metric spaces and harmonic maps, Commun. Anal. Geom., 6 (1998), 199–253. https://doi.org/10.4310/CAG.1998.v6.n2.a1 doi: 10.4310/CAG.1998.v6.n2.a1
    [42] R. T. Rockafellar, R. J. B. Wets, Variational analysis, Springer, Berlin, 2005.
    [43] S. Suantai, W. Phuengrattana, Proximal point algorithms for a hybrid pair of nonexpansive single-valued and multi-valued mappings in geodesic spaces, Mediterr. J. Math., 14 (2017), 62. https://doi.org/10.1007/s00009-017-0876-z doi: 10.1007/s00009-017-0876-z
    [44] W. Kumam, D. Kitkuan, A. Padcharoen, P. Kumam, Proximal point algorithm for nonlinear multivalued type mappings in Hadamard spaces, Math. Methods Appl. Sci., 42 (2019), 5758–5768. https://doi.org/10.1002/mma.5552 doi: 10.1002/mma.5552
    [45] S. Q. Weng, D. P. Wu, Y. C. Liou, F. Song, Convergence of modified proximal point algorithm in CAT(0) spaces, J. Nonlinear Convex Anal., 21 (2020), 2287–2298.
    [46] S. Weng, D. Wu, Z. Chao, A modified proximal point algorithm and some convergence results, J. Math., 2021 (2021), 6951062. https://doi.org/10.1155/2021/6951062 doi: 10.1155/2021/6951062
  • This article has been cited by:

    1. Muhammad Tariq, Muhammad Arshad, Eskandar Ameer, Ahmad Aloqaily, Suhad Subhi Aiadi, Nabil Mlaiki, On Relational Weak Fℜm,η-Contractive Mappings and Their Applications, 2023, 15, 2073-8994, 922, 10.3390/sym15040922
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1535) PDF downloads(61) Cited by(1)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog