- Research
- Open access
- Published:
Halpern-Mann’s iterations for Bregman strongly nonexpansive mappings in reflexive Banach spaces with applications
Journal of Inequalities and Applications volume 2013, Article number: 146 (2013)
Abstract
We investigate strong convergence for Bregman strongly nonexpansive mappings by modifying Halpern and Mann’s iterations in the framework of a reflexive Banach space. As applications, we apply our main result to problems of finding zeros of maximal monotone operators and equilibrium problems in reflexive Banach spaces.
MSC:47H05, 47H09, 47J25.
1 Introduction
Throughout this paper, we denote by ℕ and ℝ the sets of positive integers and real numbers, respectively. Let E be a real reflexive Banach space, and let C be a nonempty, closed and convex subset of E. Let be a nonlinear mapping. The fixed point set of T is denoted by , that is, . A mapping T is said to be nonexpansive if
for all .
Many problems in nonlinear analysis can be reformulated as a problem of finding a fixed point of a nonexpansive mapping. In 1953, Mann [1] introduced the following iterative sequence which is defined by
where the initial guess is arbitrary and is a real sequence in . It is known that under appropriate settings, the sequence converges weakly to a fixed point of T. However, even in a Hilbert space, Mann’s iteration may fail to converge strongly; for example, see [2].
Some attempts to construct an iteration method guaranteeing the strong convergence have been made. For example, Halpern [3] proposed the following so-called Halpern iteration:
where are arbitrary and is a real sequence in .
Because of a simple construction, Halpern’s iteration is widely used to approximate a solution of fixed points for nonexpansive mappings and other classes of nonlinear mappings by mathematicians in different styles [4–12].
The purpose of this work is to consider strong convergence results for Bregman strongly nonexpansive mappings in reflexive Banach spaces by modifying Halpern and Mann’s iterations. We note that there are many examples which are Bregman strongly nonexpansive such as the Bregman projection, the resolvents of maximal monotone operators, the resolvents of equilibrium problems, the resolvents of variational inequality problems and others (see, for example, [13–16]). Finally, we give some applications concerning the problems of finding zeros of maximal monotone operators and equilibrium problems.
2 Preliminaries and lemmas
In the sequel, we begin by recalling some preliminaries and lemmas which will be used in the proof.
Let E be a real reflexive Banach space with the norm , and let be the dual space of E. Throughout this paper, is a proper, lower semi-continuous and convex function. We denote by domf the domain of f, that is, the set .
Let . The subdifferential of f at x is the convex set defined by
where the Fenchel conjugate of f is the function defined by
We know that the following Young-Fenchel inequality holds:
Furthermore, the equality holds if (see also [[17], Theorem 23.5]).
The set for some is called a sublevel of f.
A function f on E is coercive [18] if the sublevel set of f is bounded; equivalently,
A function f on E is said to be strongly coercive [19] if
For any and , the right-hand derivative of f at x in the direction y is defined by
The function f is said to be Gâteaux differentiable at x if exists for any y. In this case, coincides with , the value of the gradient ∇f of f at x. The function f is said to be Gâteaux differentiable if it is Gâteaux differentiable for any . The function f is said to be Fréchet differentiable at x if this limit is attained uniformly in . Finally, f is said to be uniformly Fréchet differentiable on a subset C of E if the limit is attained uniformly for and . It is known that if f is Gâteaux differentiable (resp. Fréchet differentiable) on , then f is continuous and its Gâteaux derivative ∇f is norm-to-weak∗ continuous (resp. continuous) on (see also [20, 21]). We will need the following result.
Lemma 2.1 [22]
If is uniformly Fréchet differentiable and bounded on bounded subsets of E, then ∇f is uniformly continuous on bounded subsets of E from the strong topology of E to the strong topology of .
Definition 2.2 [23]
The function f is said to be:
-
(i)
Essentially smooth if ∂f is both locally bounded and single-valued on its domain.
-
(ii)
Essentially strictly convex if is locally bounded on its domain and f is strictly convex on every convex subset of .
-
(iii)
Legendre if it is both essentially smooth and essentially strictly convex.
Remark 2.3 Let E be a reflexive Banach space. Then we have
-
(i)
f is essentially smooth if and only if is essentially strictly convex (see [[23], Theorem 5.4]).
-
(ii)
(see [21]).
-
(iii)
f is Legendre if and only if is Legendre (see [[23], Corollary 5.5]).
-
(iv)
If f is Legendre, then ∇f is a bijection satisfying , and (see [[23], Theorem 5.10]).
Examples of Legendre functions were given in [23, 24]. One important and interesting Legendre function is () when E is a smooth and strictly convex Banach space. In this case the gradient ∇f of f is coincident with the generalized duality mapping of E, i.e., (). In particular, the identity mapping in Hilbert spaces. In the rest of this paper, we always assume that is Legendre.
Let be a convex and Gâteaux differentiable function. The function defined as follows:
is called the Bregman distance with respect to f [25].
Recall that the Bregman projection [26] of onto the nonempty closed and convex set is the necessarily unique vector satisfying
Concerning the Bregman projection, the following are well known.
Lemma 2.4 [27]
Let C be a nonempty, closed and convex subset of a reflexive Banach space E. Let be a Gâteaux differentiable and totally convex function, and let . Then
-
(a)
if and only if , .
-
(b)
(2.1)
Let be a convex and Gâteaux differentiable function. The modulus of total convexity of f at is the function defined by
The function f is called totally convex at x if whenever . The function f is called totally convex if it is totally convex at any point and is said to be totally convex on bounded sets if for any nonempty bounded subset B of E and , where the modulus of total convexity of the function f on the set B is the function defined by
We know that f is totally convex on bounded sets if and only if f is uniformly convex on bounded sets (see [[27], Theorem 2.10]).
The next lemma turns out to be very useful in the proof of our main results.
Proposition 2.5 [28]
If , then the following statements are equivalent.
-
(i)
The function f is totally convex at x.
-
(ii)
For any sequence ,
Recall that the function f is called sequentially consistent [27] if for any two sequences and in E such that the first one is bounded,
Lemma 2.6 [29]
The function f is totally convex on bounded sets if and only if the function f is sequentially consistent.
Let C be a convex subset of , and let T be a self-mapping of C. A point is called an asymptotic fixed point of T (see [30, 31]) if C contains a sequence which converges weakly to p such that . We denote by the set of asymptotic fixed points of T.
Definition 2.7 A mapping T with a nonempty asymptotic fixed point set is said to be:
and if whenever is bounded, and
it follows that
or, equivalently,
The existence and approximation of Bregman firmly nonexpansive mappings was studied in [16]. It is also known that if T is Bregman firmly nonexpansive and f is a Legendre function which is bounded, uniformly Fréchet differentiable and totally convex on bounded subsets of E, then and is closed and convex (see [16]). It also follows that every Bregman firmly nonexpansive mapping is Bregman strongly nonexpansive with respect to .
Let be a convex, Legendre and Gâteaux differentiable function. Following [34] and [25], we make use of the function associated with f, which is defined by
for all , . Then is nonnegative and for all and . We know the following lemma (see [35]).
Lemma 2.8 Let E be a reflexive Banach space, let be a convex, Legendre and Gâteaux differentiable function, and let be as in (2.3). Then
for all and .
Let E be a real reflexive Banach space, let be a proper lower semi-continuous function, then is a proper weak∗ lower semi-continuous and convex function (see [36]). Hence is convex in the second variable. Thus, for all , we have
where and with .
The following results are of fundamental importance for the techniques of analysis used in this paper.
Lemma 2.9 [37]
Assume that is a sequence of nonnegative real numbers such that
where is a sequence in and is a sequence such that
-
(a)
, ;
-
(b)
.
Then .
Lemma 2.10 [38]
Let be a sequence of real numbers such that there exists a subsequence of such that for all . Then there exists a nondecreasing sequence such that , and the following properties are satisfied for all (sufficiently large) numbers :
In fact, .
3 Main results
In this section, we modify Halpern and Mann’s iterations for finding a fixed point of a Bregman strongly nonexpansive mapping in a real reflexive Banach space.
Lemma 3.1 [39]
Let C be a nonempty, closed and convex subset of a real reflexive Banach space E. Let be a Gâteaux differentiable and totally convex function, and let be a mapping such that is nonempty, closed and convex. Suppose that and is a bounded sequence in C such that . Then
where and is the Bregman projection of C onto .
Theorem 3.2 Let E be a real reflexive Banach space E, and let be a strongly coercive Legendre function which is bounded, uniformly Fréchet differentiable and totally convex on bounded subsets of E. Let T be a Bregman strongly nonexpansive mapping on E such that . Suppose that and define the sequence as follows: and
where and are sequences in satisfying
(C1) ;
(C2) ;
(C3) .
Then converges strongly to , where is the Bregman projection of E onto .
Proof We note, by Reich and Sabach [16], that is closed and convex. Let and for all . Then
for all . By using (2.5) and (2.2), we have
and
By induction, we have
for all . This implies that is bounded, and hence is bounded.
We next show that the sequence is also bounded. We follow the proof line as in [16]. Since is bounded, there exists such that
Hence is contained in the sublevel set , where . Since f is lower semicontinuous, is weak∗ lower semicontinuous. Hence the function ψ is coercive by Moreau-Rockafellar theorem (see [[40], Theorem 7A]). This shows that is bounded. Since f is strongly coercive, is bounded on bounded sets (see [[23], Theorem 3.3]). Hence is also bounded on bounded subsets of (see [[29], Proposition 1.1.11]). Since f is a Legendre function, it follows that is bounded for all . Therefore is bounded. So are , , and . Indeed, since f is a bounded function defined on bounded subsets of E, ∇f is also bounded on bounded subsets of E (see [[29], Proposition 1.1.11]). Therefore is bounded.
We next show that if there exists a subsequence of such that
then
In fact, since is bounded and , from (3.2) we have
Since f is strongly coercive and uniformly convex on bounded subsets of E, is uniformly Fréchet differentiable on bounded subsets of (see [[19], Proposition 3.6.2]). Since f is Legendre, by Lemma 2.1, we have
On the other hand, since f is uniformly Fréchet differentiable on bounded subsets of E, f is uniformly continuous on bounded subsets of E (see [[41], Theorem 1.8]). It follows that
We now consider the following equality.
It follows from (3.4)-(3.6) that
and
By virtue of condition (C3), (2.2) and (3.8), we have
We next consider the following two cases.
Case 1. for all sufficiently large n. Hence the sequence is bounded and nonincreasing. So, the limit exists. This shows that , and hence
Since T is Bregman strongly nonexpansive, we have
Since f is totally convex on bounded subsets of E, by Lemma 2.6, we have
From (2.5) we have
and
From (3.11), (3.12) and Lemma 2.6, we get
From (3.10), (3.13) and invoking Lemma 3.1, we have
Finally, we show that . In fact, by using (2.4), we obtain that
By Lemma 2.9, we can conclude that . Therefore, by Lemma 2.6, since f is totally convex on bounded subsets of E.
Case 2. Suppose that there exists a subsequence of such that
for all . Then, by Lemma 2.10, there exists a nondecreasing sequence such that
for all . So, we have
This implies
Following the proof line in Case 1, we can verify
and
Since , we have
In particular, since , we get
Hence it follows from (3.18) that . Using this and (3.17) together, we conclude that
This completes the proof. □
Letting gives the following result.
Corollary 3.3 Let E be a real reflexive Banach space E, and let be a strongly coercive Legendre function which is bounded, uniformly Fréchet differentiable and totally convex on bounded subsets of E. Let T be a Bregman strongly nonexpansive mapping on E such that . Suppose that and define the sequence as follows: and
for all , where is a sequence in satisfying conditions (C1) and (C2), and . Then converges strongly to .
4 Application to a zero point problem of maximal monotone mappings and equilibrium problems
Let E be a real reflexive Banach space. Let be a set-valued mapping. The domain of A is denoted by , and also the graph of A is denoted by . A is said to be monotone if for each . It is said to be maximal monotone if its graph is not contained in the graph of any other monotone operator on E. It is known that if A is maximal monotone, then the set is closed and convex. Now, we apply Theorem 3.2 to the problem of finding such that , which strongly relates to the convex minimization problems in optimization, economics and applied sciences.
The resolvent of A, denoted by , is defined as follows [13]:
It is known that , and is single-valued and Bregman firmly nonexpansive (see [13]). If f is a Legendre function which is bounded, uniformly Fréchet differentiable on bounded subsets of E, then (see [16]). The Yosida approximation , , is also defined by
for all . From Proposition 2.7 in [42], we know that and if and only if for all and . Using these facts, we obtain the following result by replacing , in Theorem 3.2.
Theorem 4.1 Let C be a nonempty, closed and convex subset of a real reflexive Banach space E, and let be a strongly coercive Legendre function which is bounded, uniformly Fréchet differentiable and totally convex on bounded subsets of E. Let be a maximal monotone operator such that . Suppose that and define the sequence as follows: and
where and and are sequences in satisfying
(C1) ;
(C2) ;
(C3) .
Then converges strongly to , where is the Bregman projection of E onto .
Let C be a nonempty, closed and convex subset of E, and let be a bifunction. Now, we apply Theorem 3.2 to the problem of finding such that for all . Such a problem is called an equilibrium problem and the solutions set is denoted by . Numerous problems in economics, physics and applied sciences can be reduced to finding solutions of equilibrium problems.
In order to solve the equilibrium problem, let us assume that a bifunction satisfies the following conditions [43]:
() , .
() Θ is monotone, i.e., , .
() , .
() The function is convex and lower semi-continuous.
The resolvent of a bifunction Θ [44] is the operator defined by
From Lemma 1 in [15], if is a strongly coercive and Gâteaux differentiable function, and Θ satisfies conditions ()-(), then .
The following lemma gives us some characterizations of the resolvent .
Lemma 4.2 [15]
Let E be a real reflexive Banach space, and let C be a nonempty closed convex subset of E. Let be a Legendre function. If the bifunction satisfies the conditions ()-(). Then the following hold:
-
(i)
is single-valued;
-
(ii)
is a Bregman firmly nonexpansive operator;
-
(iii)
;
-
(iv)
is a closed and convex subset of C;
-
(v)
for all and for all , we have
In addition, by Reich and Sabach [16], if f is uniformly Fréchet differentiable and bounded on bounded subsets of E, then we have from Lemma 4.2 that is closed and convex. Also, by replacing in Theorem 3.2, we obtain the following result.
Theorem 4.3 Let C be a nonempty, closed and convex subset of a real reflexive Banach space E, and let be a strongly coercive Legendre function which is bounded, uniformly Fréchet differentiable and totally convex on bounded subsets of E. Let be a bifunction which satisfies the conditions ()-() such that . Suppose that and define the sequence as follows: and
where and are sequences in satisfying
(C1) ;
(C2) ;
(C3) .
Then converges strongly to , where is the Bregman projection of E onto .
References
Mann WR: Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4: 506–510. 10.1090/S0002-9939-1953-0054846-3
Genel A, Lindenstrauss J: An example concerning fixed points. Isr. J. Math. 1975, 22: 957–962.
Halpern B: Fixed points of nonexpanding maps. Bull. Am. Math. Soc. 1967, 73: 957–961. 10.1090/S0002-9904-1967-11864-0
Lions PL: Approximation de points fixes de contractions. C. R. Math. Acad. Sci. Paris, Sér. A-B 1977, 284: A1357-A1359.
Reich S: Approximating fixed points of nonexpansive mappings. Panam. Math. J. 1994, 4: 23–28.
Wittmann R: Approximation of fixed points of nonexpansive mappings. Arch. Math. 1992, 58: 486–491. 10.1007/BF01190119
Shioji N, Takahashi W: Strong convergence of approximated sequences for nonexpansive mapping in Banach spaces. Proc. Am. Math. Soc. 1997, 125: 3641–3645. 10.1090/S0002-9939-97-04033-1
Xu HK: Another control condition in an iterative method for nonexpansive mappings. Bull. Aust. Math. Soc. 2002, 65: 109–113. 10.1017/S0004972700020116
Cho YJ, Kang SM, Zhou H: Some control conditions on iterative methods. Commun. Appl. Nonlinear Anal. 2005, 12: 27–34.
Chidume CE, Chidume CO: Iterative approximation of fixed points of nonexpansive mappings. J. Math. Anal. Appl. 2006, 318: 288–295. 10.1016/j.jmaa.2005.05.023
Suzuki T: A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings. Proc. Am. Math. Soc. 2007, 135: 99–106.
Saejung S: Halpern’s iteration in Banach spaces. Nonlinear Anal. TMA 2010, 73: 3431–3439. 10.1016/j.na.2010.07.031
Bauschke HH, Borwein JM, Combettes PL: Bregman monotone optimization algorithms. SIAM J. Control Optim. 2003, 42: 596–636. 10.1137/S0363012902407120
Butnariu D, Kassay G: A proximal-projection method for finding zeroes of set-valued operators. SIAM J. Control Optim. 2008, 47: 2096–2136. 10.1137/070682071
Reich S, Sabach S: Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces. Nonlinear Anal. TMA 2010, 73: 122–135. 10.1016/j.na.2010.03.005
Reich S, Sabach S: Existence and approximation of fixed points of Bregman firmly nonexpansive mappings in reflexive Banach spaces. In Fixed-Point Algorithms for Inverse Problems in Science and Engineering. Springer, New York; 2011:301–316.
Rockafellar RT: Convex Analysis. Princeton University Press, Princeton; 1970.
Hiriart-Urruty J-B, Lemaréchal C Grundlehren der mathematischen Wissenschaften 306. In Convex Analysis and Minimization Algorithms II. Springer, Berlin; 1993.
Zǎlinescu C: Convex Analysis in General Vector Spaces. World Scientific, River Edge; 2002.
Asplund E, Rockafellar RT: Gradients of convex functions. Trans. Am. Math. Soc. 1969, 139: 443–467.
Bonnans JF, Shapiro A: Perturbation Analysis of Optimization Problems. Springer, New York; 2000.
Reich S, Sabach S: A strong convergence theorem for a proximal-type algorithm in reflexive Banach spaces. J. Nonlinear Convex Anal. 2009, 10: 471–485.
Bauschke HH, Borwein JM, Combettes PL: Essential smoothness, essential strict convexity, and Legendre functions in Banach spaces. Commun. Contemp. Math. 2001, 3: 615–647. 10.1142/S0219199701000524
Bauschke HH, Borwein JM: Legendre functions and the method of random Bregman projections. J. Convex Anal. 1997, 4: 27–67.
Censor Y, Lent A: An iterative row-action method for interval convex programming. J. Optim. Theory Appl. 1981, 34: 321–353. 10.1007/BF00934676
Bregman LM: The relaxation method for finding the common point of convex sets and its application to the solution of problems in convex programming. U.S.S.R. Comput. Math. Math. Phys. 1967, 7: 200–217.
Butnariu D, Resmerita E: Bregman distances, totally convex functions and a method for solving operator equations in Banach spaces. Abstr. Appl. Anal. 2006., 2006: Article ID 84919
Resmerita E: On total convexity, Bregman projections and stability in Banach spaces. J. Convex Anal. 2004, 11: 1–16.
Butnariu D, Iusem AN: Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization. Kluwer Academic, Dordrecht; 2000.
Censor Y, Reich S: Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization. Optimization 1996, 37: 323–339. 10.1080/02331939608844225
Reich S: A weak convergence theorem for the alternating method with Bregman distances. In Theory and Applications of Nonlinear Operators of Accretive and Monotone Type. Dekker, New York; 1996:313–318.
Bruck RE, Reich S: Nonexpansive projections and resolvents of accretive operators in Banach spaces. Houst. J. Math. 1977, 3: 459–470.
Kohsaka F, Takahashi W: Existence and approximation of fixed points of firmly nonexpansive-type mappings in Banach spaces. SIAM J. Control Optim. 2008, 19: 824–835. 10.1137/070688717
Alber YI: Metric and generalized projection operators in Banach spaces: properties and applications. In Theory and Applications of Nonlinear Operator of Accretive and Monotone Type. Edited by: Kartsatos AG. Dekker, New York; 1996:15–50.
Kohsaka F, Takahashi W: Proximal point algorithms with Bregman functions in Banach spaces. J. Nonlinear Convex Anal. 2005, 6: 505–523.
Phelps RP Lecture Notes in Mathematics 1364. In Convex Functions, Monotone Operators, and Differentiability. 2nd edition. Springer, Berlin; 1993.
Xu HK: Another control condition in an iterative method for nonexpansive mappings. Bull. Aust. Math. Soc. 2002, 65: 109–113. 10.1017/S0004972700020116
Mainge PE: Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Anal. 2008, 16: 899–912. 10.1007/s11228-008-0102-z
Suantai S, Cho YJ, Cholamjiak P: Halpern’s iteration for Bregman strongly nonexpansive mappings in reflexive Banach spaces. Comput. Math. Appl. 2012, 64: 489–499. 10.1016/j.camwa.2011.12.026
Rockafellar RT: Level sets and continuity of conjugate convex functions. Trans. Am. Math. Soc. 1966, 123: 46–63. 10.1090/S0002-9947-1966-0192318-X
Ambrosetti A, Prodi G: A Primer of Nonlinear Analysis. Cambridge University Press, Cambridge; 1993.
Reich S, Sabach S: Two strong convergence theorems for a proximal method in reflexive Banach spaces. Numer. Funct. Anal. Optim. 2010, 31: 22–44. 10.1080/01630560903499852
Blum E, Oettli W: From optimization and variational inequalities to equilibrium problems. Math. Stud. 1994, 63: 123–145.
Combettes PL, Hirstoaga SA: Equilibrium programming in Hilbert spaces. J. Nonlinear Convex Anal. 2005, 6: 117–136.
Acknowledgements
The authors would like to express their thanks to the referees for their helpful comments and suggestions. This work was supported by the Scientific Research Fund of Sichuan Provincial Education Department (12ZA295), the Scientific Research Fund of Science Technology Department of Sichuan Province (2011JYZ011) and the Natural Science foundation of Yibin university (2011Z08).
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Zhu, Jh., Chang, Ss. Halpern-Mann’s iterations for Bregman strongly nonexpansive mappings in reflexive Banach spaces with applications. J Inequal Appl 2013, 146 (2013). https://doi.org/10.1186/1029-242X-2013-146
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029-242X-2013-146