International Journal of Mathematics and Mathematical SciencesVolume 2011 (2011), Article ID 420192, 23 pagesdoi:10.1155/2011/420192

Research Article

Approximation of Fixed Points of Weak Bregman Relatively Nonexpansive Mappings in Banach Spaces

Jiawei Chen, Zhongping Wan, Liuyang Yuan, and Yue Zheng

School of Mathematics and Statistics, Wuhan University, Wuhan, Hubei 430072, China

Received 7 April 2011; Accepted 19 May 2011

Academic Editor: Yonghong Yao

Copyright © 2011 Jiawei Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

We introduce a concept of weak Bregman relatively nonexpansive mapping which is distinct from Bregman relatively nonexpansive mapping. By using projection techniques, we construct several modification of Mann type iterative algorithms with errors and Halpern-type iterative algorithms with errors to find fixed points of weak Bregman relatively nonexpansive mappings and Bregman relatively nonexpansive mappings in Banach spaces. The strong convergence theorems for weak Bregman relatively nonexpansive mappings and Bregman relatively nonexpansive mappings are derived under some suitable assumptions. The main results in this paper develop, extend, and improve the corresponding results of Matsushita and Takahashi (2005) and Qin and Su (2007).

1. Introduction

Throughout this paper, without other specifications, we denote by the set of real numbers. Let be a real reflexive Banach space with the dual space . The norm and the dual pair between and are denoted by and , respectively. Let be proper convex and lower semicontinuous. The Fenchel conjugate of is the function defined by We denote by the domain of , that is, . Let be a nonempty closed and convex subset of a nonlinear mapping. Denote by , the set of fixed points of . is said to be nonexpansive if for all .

In 1967, Brègman [1] discovered an elegant and effective technique for the using of the so-called Bregman distance function (see, Section 2, Definition 2.1) in the process of designing and analyzing feasibility and optimization algorithms. This opened a growing area of research in which Bregman's technique is applied in various ways in order to design and analyze iterative algorithms for solving not only feasibility and optimization problems, but also algorithms for solving variational inequalities, for approximating equilibria, for computing fixed points of nonlinear mappings, and so on (see, e.g., [1–25], and the references therein).

Nakajo and Takahashi [26] introduced the following modification of the Mann iteration method for a nonexpansive mapping in a Hilbert space as follows: where and is the metric projection from onto a closed and convex subset of . They proved that generated by (1.2) converges strongly to a fixed point of under some suitable assumptions. Motivated by Nakajo and Takahashi [26], Matsushita and Takahashi [27] introduced the following modification of the Mann iteration method for a relatively nonexpansive mapping in a Banach space as follows: where , for all , is the duality mapping of and is the generalized projection (see, e.g., [2, 3, 28]) from onto a closed and convex subset of . They also proved that generated by (1.3) converges strongly to a fixed point of under some suitable assumptions. Martinez-Yanes and Xu [29] gave a Halpern-type iterative algorithm for a nonexpansive mapping as follows: where . They derived that generated by (1.3) converges strongly to a fixed point of under some suitable assumptions. Qin and Su [30] generalized the results of Martinez-Yanes and Xu [29] to a uniformly convex and uniformly smooth Banach space for a relatively nonexpansive mapping and proposed the following iterative algorithm: where , is the generalized projection (see, e.g., [2, 3, 28]) from onto a closed and convex subset of . They also obtained that generated by (1.5) converges strongly to a fixed point of under some suitable assumptions. In 2003, Butnariu et al. [13] studied several notions of convex analysis: uniformly convexity at a point, total convexity at a point, uniformly convexity on bounded sets, and sequential consistency, which are useful in establishing convergence properties for fixed point and optimization algorithms in infinite dimensional Banach spaces. They established connections between these concepts and used these relations in order to obtain improved convergence results concerning the outer Bregman projection algorithm for solving convex feasibility problems and the generalized proximal point algorithm for optimization in Banach spaces. In 2006, Butnariu and Resmerita [14] presented a Bregman-type iterative algorithms and studied the convergence of the Bregman-type iterative method of solving operator equations. Resmerita [19] investigated the existence of totally convex functions in Banach spaces and, further, established continuity and stability properties of Bregman projections. Very recently, by using Bregman projection, Reich and Sabach [21] presented the following algorithms for finding common zeroes of maximal monotone operators in reflexive Banach space as follows: Further, under some suitable conditions, they obtained two strong convergence theorems of maximal monotone operators in reflexive Banach spaces. Reich and Sabach [22] studied the convergence of two iterative algorithms for finitely many Bregman strongly nonexpansive operators in Banach spaces and obtained two strong convergence theorems for finitely many Bregman strongly nonexpansive operators under some assumptions. In [24], Reich and Sabach proposed the following algorithms for finding common fixed points of finitely many Bregman firmly nonexpansive operators in reflexive Banach space as follows: if Under some suitable conditions, they proved that the sequence generated by (1.8) converges strongly to and applied it to the solution of convex feasibility and equilibrium problems.

Inspired and motivated by the works, we introduce the concept of weak Bregman relatively nonexpansive mappings in reflexive Banach space and give an example to illustrate the existence of weak Bregman relatively nonexpansive mapping and the difference between weak Bregman relatively nonexpansive mapping and Bregman relatively nonexpansive mapping. Secondly, by using the conception of the Bregman projection (see, e.g., [1, 13, 14]), we construct several modification of Mann type iterative algorithms with errors and Halpern-type iterative algorithms with errors to find fixed points of weak Bregman relatively nonexpansive mappings and Bregman relatively nonexpansive mappings in Banach spaces. The strong convergence theorems for weak Bregman relatively nonexpansive mappings and Bregman relatively nonexpansive mappings are derived under some suitable assumptions. Moreover, the convergence rate of our algorithms is faster than that of Matsushita and Takahashi [27] and Qin and Su [30]. The main results in this paper develop, extend, and improve the corresponding results in the literature.

2. Preliminaries

Let be a nonempty closed convex subset of a real reflexive Banach space , and let be a nonlinear mapping. A point is called an asymptotic fixed point of (see, e.g., [2, 3]) if contains a sequence which converges weakly to such that . A point is called an strong asymptotic fixed point of (see, e.g., [2, 3]) if contains a sequence which converges strongly to such that . We denote the sets of asymptotic fixed points and strong asymptotic fixed points of by and , respectively. When is a sequence in , we denote strong convergence of to by . For any and , the right-hand derivative of at in the direction defined by is called Gâteaux differentiable at if, for all exists. In this case, coincides with , the value of the gradient of at . is called Gâteaux differentiable if it is Gâteaux differentiable for any . is called Fréchet differentiable at if this limit is attained uniformly for . We say is uniformly Fréchet differentiable on a subset of if the limit is attained uniformly for and .

Legendre function is defined in [7]. From [7], if is a reflexive Banach space, then is Legendre if and only if it satisfies the following conditions (L1) and (L2):(L1) the interior of the domain of , , is nonempty, is Gâteaux differentiable on , and ,(L2) the interior of the domain of , , is nonempty, is Gâteaux differentiable on , and .

Since is reflexive, we know that (see, e.g., [31]). This, by (L1) and (L2), implies By Theorem 5.4 [7], conditions (L1) and (L2) also yield that the functions and are strictly convex on the interior of their respective domains. From now on, we assume that the convex function is Legendre.

We first recall some definitions and lemmas which are needed in our main results.

Definition 2.1 (see [1, 13]). Let be a Gâteaux differentiable and convex function. The function , defined by is called the Bregman distance with respect to .

Remark 2.2 (see [24]). The Bregman distance has the following properties:(i)the three point identity, for any and ,(ii) the four point identity, for any and ,

Definition 2.3 (see [1]). Let be a Gâteaux differentiable and convex function. The Bregman projection of onto the nonempty closed and convex set is the necessarily unique vector satisfying

Remark 2.4. (i) If is a Hilbert space and for all , then the Bregman projection is reduced to the metric projection of onto .(ii) If is a smooth Banach space and for all , then the Bregman projection is reduced to the generalized projection (see, e.g. [3]) which defined by where is the normalized duality mapping from to .

Definition 2.5 (see[12, 21]). Let be a nonempty closed and convex set of . The operator with is called: (i)quasi-Bregman nonexpansive if (ii) Bregman relatively nonexpansive if and ,(iii) Bregman firmly nonexpansive if or equivalently

Definition 2.6. Let be a nonempty closed and convex set of . The operator with is called weak Bregman relatively nonexpansive if and

Remark 2.7. It is easy to see that each nonexpansive mapping is quasi-Bregman nonexpansive mapping with respect to for all . Moreover, every relatively nonexpansive mapping also is Bregman relatively nonexpansive mapping, where is called relatively nonexpansive mapping (see, e.g., [32]) if the following conditions are satisfied: Now, we give an example which is weak Bregman relatively nonexpansive mapping but not Bregman relatively nonexpansive mapping.

Example 2.8. Let for all , where and for any . It is well known that is a Hilbert space. Let be a sequence defined by , , where for all .Define a mapping by for all . It is easy to see that , and so, converges weakly to . Indeed, for any , we have From , it shows that . Moreover, Next, for any , one has ; that is, is not a Cauchy sequence. Owing to , we obtain Then, is an asymptotic fixed point of , but . So, is not Bregman relatively nonexpansive mapping.For any strong convergent sequence such that and as . Then, there exists a sufficiently large nature number such that for any . Thus, for , which implies that and as . That is, is a strong asymptotic fixed point of , and so, . Since Therefore, is a weak Bregman relatively nonexpansive mapping.

Definition 2.9 (see [12]). Let be a convex and Gâteaux differentiable function. is called: (i)totally convex at if its modulus of total convexity at ; that is, the function defined by is positive whenever ,(ii)totally convex if, it is totally convex at every point ,(iii)totally convex on bounded sets if is positive for any nonempty bounded subset of and , where the modulus of total convexity of the function on the set is the function defined by

Definition 2.10 (see [12, 21]). The function is called:(i)cofinite if ,(ii)sequentially consistent if, for any two sequences and in such that the first is bounded, and

Lemma 2.11 (see [21, Proposition 2.3]). If is Fréchet differentiable and totally convex, then is cofinite.

Lemma 2.12 (see [14, Theorem 2.10]). Let be a convex function whose domain contains at least two points. Then, the following statements hold: (i) is sequentially consistent if and only if it is totally convex on bounded sets, (ii)if is lower semicontinuous, then is sequentially consistent if and only if it is uniformly convex on bounded sets, (iii)if is uniformly strictly convex on bounded sets, then it is sequentially consistent and the converse implication holds when is lower semicontinuous, Fréchet differentiable on its domain, and the Fréchet derivative is uniformly continuous on bounded sets.

Lemma 2.13 (see [20, Proposition 2.1]). Let be a uniformly Fréchet differentiable and bounded on bounded subsets of . Then, is uniformly continuous on bounded subsets of from the strong topology of to the strong topology of .

Lemma 2.14 (see [21, Lemma 3.1]). Let be a Gâteaux differentiable and totally convex function. If and the sequence is bounded, then the sequence is also bounded.

Lemma 2.15 (see [21, Proposition 2.2]). Let be a Gâteaux differentiable and totally convex function, , and let be a nonempty closed convex subset of . Suppose that the sequence is bounded and any weak subsequential limit of belongs to . If for any , then converges strongly to .

In [23], Reich and Sabach proved the following result.

Lemma 2.16 (see[23, Lemma 15.5]). Let be a Legendre function. Let be a nonempty closed convex subset of and a Bregman firmly nonexpansive mapping with respect to . Then, is closed and convex.

Motivated by Lemma 2.16, we get the similar result for quasi-Bregman nonexpansive mapping.

Proposition 2.17. Let be a Legendre function. Let be a nonempty closed convex subset of and a quasi-Bregman nonexpansive mapping with respect to . Then, is closed and convex.

Proof. Without loss of generality, set is nonempty. Firstly, we show that is closed. Let be a sequence in such that . By the definition of quasi-Bregman nonexpansive mapping, we have Since is a Legendre function, is continuous at . Then, from the definition of Bregman distance, From (2.24) and (2.25), it follows that , and so, from [7, Lemma 7.3(vi), page 642], . Therefore, , and so, is closed.We now show that is convex. For any and , it yields that . From the definition of quasi-Bregman nonexpansive mapping, it follows that Again, from [7, Lemma 7.3(vi), page 642], we get . Therefore, is convex. This completes the proof.

From the definitions of Bregman distance and the Fenchel conjugate of , we have the following result.

Lemma 2.18. Let be a Gâteaux differentiable and proper convex lower semicontinuous. Then, for all , where and with .

Lemma 2.19 (see [14, Corollary 4.4]). Let be a Gâteaux differentiable and totally convex on . Let and a nonempty closed convex set. If , then the following statements are equivalent: (i)the vector is the Bregman projection of onto with respect to ,(ii) the vector is the unique solution of the variational inequality (iii) the vector is the unique solution of the inequality

3. Main Results

In this section, we introduce several modification of Mann-type iterative algorithms with errors and Halpern-type iterative algorithms with errors to find fixed points of weak Bregman relatively nonexpansive mappings and Bregman relatively nonexpansive mappings in Banach spaces. The strong convergence theorems for weak Bregman relatively nonexpansive mappings and Bregman relatively nonexpansive mappings are proved under some suitable conditions.

Theorem 3.1. Let be a nonempty closed convex subset of a real reflexive Banach space and a Legendre function which is bounded, uniformly Fréchet differentiable, and totally convex on bounded subset of , and let be a weak Bregman relatively nonexpansive mapping such that . Define a sequence in by the following algorithm: where such that , and is an error sequence in with as . Then, the sequences and converge strongly to the point , where is the Bregman projection of onto .

Proof. By Proposition 2.17, it follows that is a nonempty closed and convex subset of . It is easy to verify that , and are closed and convex. Suppose that and are closed and convex. Then, is closed and convex. For any , which implies that and are closed and convex. As a consequence, and are closed and convex for all . Taking arbitrarily, that is, , and so, for all . We now show that for all . Clearly, . Assume that for all . Note that , and we have Therefore, which yields that . Then, for all . Consequently, and is nonempty closed and convex for all . Moreover, is well defined.Secondly, we show that is a Cauchy sequence and bounded. Since it follows that . Therefore, by , Taking arbitrarily. From Lemma 2.19, it yields that Moreover, one has Hence, is bounded and so , , and are also bounded. From (3.7), it shows that exists. In the light of for any , by Lemma 2.19, that is, Consequently, one has Since is totally convex on bounded subsets of , by Lemma 2.12 and (3.12), we have Thus, is a Cauchy sequence, and so, Since as , one has Let . Then, .Thirdly, we show that converges strongly to a point of . Since is uniformly Fréchet differentiable on bounded subsets of , from Lemma 2.12, is norm-to-norm uniformly continuous on bounded subsets of . So, by (3.15), It follows from that By the uniformly Fréchet differentiable of on bounded subsets of , is also uniformly continuous on bounded subsets of . Hence, from (3.12) and , As a consequence, and so, . Moreover, one has Since and as . Noticing that Therefore, In view of and from both (3.16) and (3.19), one has Furthermore, we have and so, by (3.14), Since and , we get .Finally, we show . Since , it follows from that . By Lemma 2.15, as . Therefore, and converge strongly to . This completes the proof.

Theorem 3.2. Let be a nonempty closed convex subset of a real reflexive Banach space and a Legendre function which is bounded, uniformly Fréchet differentiable, and totally convex on bounded subset of , and let be a Bregman relatively nonexpansive mapping such that . Assume that such that , and is an error sequence in with as . Then, the sequences and generated by (3.1) converge strongly to the point , where is the Bregman projection of onto .

Proof. As in the proof of Theorem 3.1, we know that the sequences and converge strongly to , and so, Then, for any subsequence of converges weakly to , Therefore, . By the similar proof of Theorem 3.2, the sequences and converge strongly to . This completes the proof.

If , , and for all , , then from Remark 2.4 and Theorem 3.1, we have the following result.

Corollary 3.3. Let be a nonempty closed convex subset of a real reflexive, smooth, and strictly convex Banach space , and let be a relatively nonexpansive mapping such that . Define a sequence in by the following algorithm: where is the duality mapping on , such that . Then, the sequences and converge strongly to the point , where is the generalized projection (see, e.g., [2, 3, 28]) of onto . In [27], Matsushita and Takahashi proved the following result.

Theorem MT (see [27, Theorem 3.1]). Let be a nonempty closed convex subset of a real uniformly convex and uniformly smooth Banach space , and let be a relatively nonexpansive mapping such that . Assume that is a sequence of real numbers such that and . Then, the sequence generated by (1.3) converges strongly to the point , where is the generalized projection (see, e.g., [2, 3, 28]) of onto .

Remark 3.4. Corollary 3.3 extends Theorem MT [27] from uniformly convex and uniformly smooth Banach spaces to reflexive, smooth, and strictly convex Banach space.Now, we investigate convergence theorems for Halpern-type iterative algorithms with errors.

Theorem 3.5. Let be a nonempty closed convex subset of a real reflexive Banach space and a Legendre function which is bounded, uniformly Fréchet differentiable, and totally convex on bounded subset of , and let be a weak Bregman relatively nonexpansive mapping such that . Define a sequence in by the following algorithm: where such that and , and is an error sequence in with as . Then, the sequences and converge strongly to the point , where is the Bregman projection of onto .

Proof. By Proposition 2.17, it follows that is a nonempty closed and convex subset of . It is easy to see that is closed and is closed and convex for all . For any , , which implies that is closed and convex for all . Since, for any , which shows that is closed and convex. As a consequence, is closed and convex for all . Taking arbitrarily, by Lemma 2.18, that is, , and so, for all . As in the proof of Theorem 3.1, we get for all , is a Cauchy sequence, , and are also bounded, and thus, Consequently, and is nonempty closed and convex for all . Moreover, is well defined. Set .Secondly, we show that converges strongly to a point of . Since is uniformly Fréchet differentiable on bounded subsets of , from Lemma 2.12, is norm-to-norm uniformly continuous on bounded subsets of . So, by (3.33), In view of , we have Due to , from (3.32), one has Therefore, . Moreover, one has Since , by (3.32) and (3.33), and thus, as . Noticing that That is, Together with , and (3.37), this yields that Since is uniformly Fréchet differentiable on bounded subsets of , from Lemma 2.12, is norm-to-norm uniformly continuous on bounded subsets of and so is . Then, by (3.41), we get From , it follows that . So, . By the same argument of Theorem 3.1, we know that and converge strongly to . This completes the proof.

If and for all , then from Theorem 3.5, we have the following result.

Corollary 3.6. Let be a nonempty closed convex subset of a real reflexive Banach space and a Legendre function which is bounded, uniformly Fréchet differentiable, and totally convex on bounded subset of , and let be a weak Bregman relatively nonexpansive mapping from into itself such that . Define a sequence in by the following algorithm: where such that and is an error sequence in with as . Then, the sequences and converges strongly to the point , where is the Bregman projection of onto .

Now, we develop a strong convergence theorem for a Bregman relatively nonexpansive mapping.

Theorem 3.7. Let be a nonempty closed convex subset of a real reflexive Banach space and a Legendre function which is bounded, uniformly Fréchet differentiable, and totally convex on bounded subset of , and let be a Bregman relatively nonexpansive mapping such that . Define a sequence in by the following algorithm: where such that and and is an error sequence in with as . Then, the sequences and converges strongly to the point , where is the Bregman projection of onto .

Proof. The proof is similar to Theorem 3.5 and so is omitted. This completes the proof.

If and for all , then from Theorem 3.7, we get the following corollary.

Corollary 3.8. Let be a real reflexive Banach space and a Legendre function which is bounded, uniformly Fréchet differentiable, and totally convex on bounded subset of , and let be a Bregman relatively nonexpansive mapping such that . Assume that is a real sequence in such that . Define a sequence by the following algorithm: Then, the sequences and converge strongly to the point , where is the Bregman projection of onto .

In [30], Qin and Su obtained the following.

Theorem QS (see [30, Theorem 2.2]). Let be a nonempty closed convex subset of a uniformly convex and uniformly smooth Banach space , and let be a relatively nonexpansive mapping such that . Assume that is a real sequence in such that . Then, the sequence generated by (1.5) converges strongly to , where is the generalized projection (see, e.g., [2, 3]) from onto .

Remark 3.9. Corollary 3.8 extends Theorems QS [30] from uniformly convex and uniformly smooth Banach spaces to reflexive Banach spaces.

4. Conclusions

In this paper, we introduce a conception of weak Bregman relatively nonexpansive mapping in reflexive Banach space and give an example to illustrate the existence of weak Bregman relatively nonexpansive mapping and the difference between weak Bregman relatively nonexpansive mapping and Bregman relatively nonexpansive mapping which enlarge the Bregman operator theory. Secondly, by using projection techniques, we construct several modification of Mann-type iterative algorithms with errors and Halpern-type iterative algorithms with errors to find fixed points of weak Bregman relatively nonexpansive mappings and Bregman relatively nonexpansive mappings in Banach spaces. Thirdly, strong convergence theorems for weak Bregman relatively nonexpansive mappings and Bregman relatively nonexpansive mappings are derived under some suitable assumptions. By further research, on the one hand, we may apply our algorithms to find zeros of finite families of maximal monotone operators, solutions of system of convex minization problems, solutions of system of variational inequalities, equilibrium, and equation operators (see, e.g., [24]). On the other hand, one may give some numerical experiments to verify the theoretical assertions and show how to compute the generalized projections. These topics will be done in the future.

Acknowledgments

The authors would like to thank anonymous referees for their constructive review and useful comments on an earlier version of the work and express gratitude to Professor Simenon Reich, Department of Mathematics, The Technion-Israel Institute of Technology, Israel, and Professor Yeol Je Cho, Department of Mathematics Education and the RINS, Gyeongsang National University, Chinju 660-701, Korea, for providing their nice works. This research is supported by the Natural Science Foundation of China (nos. 70771080, 60804065) and the Fundamental Research Fund for the Central Universities (201120102020004).

References

L. M. Brègman, “A relaxation method of finding a common point of convex sets and its application to the solution of problems in convex programming,” USSR Computational Mathematics and Mathematical Physics, vol. 7, no. 3, pp. 200–217, 1967.

Ya. I. Alber, “Generalized projection operators in Banach spaces: properties and applications,” in Functional-Differential Equations, vol. 1 of Proceedings of the Israel Seminar Ariel, Israel, Function Differential Equation, pp. 1–21, The College of Judea and Samaria, Ariel, Israel, 1994.

Y. I. Alber, “Metric and generalized projection operators in Banach spaces: properties and applications,” in Theory and Applications of Nonlinear Operators of Accretive and Monotone Type, vol. 178 of Lecture Notes in Pure and Applied Mathematics, pp. 15–50, Dekker, New York, NY, USA, 1996.

Y. Alber and D. Butnariu, “Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces,” Journal of Optimization Theory and Applications, vol. 92, no. 1, pp. 33–61, 1997.

H. H. Bauschke and J. M. Borwein, “Legendre functions and the method of random Bregman projections,” Journal of Convex Analysis, vol. 4, no. 1, pp. 27–67, 1997.

H. H. Bauschke and A. S. Lewis, “Dykstra's algorithm with Bregman projections: a convergence proof,” Optimization, vol. 48, no. 4, pp. 409–427, 2000.

H. H. Bauschke, J. M. Borwein, and P. L. Combettes, “Essential smoothness, essential strict convexity, and Legendre functions in Banach spaces,” Communications in Contemporary Mathematics, vol. 3, no. 4, pp. 615–647, 2001.

H. H. Bauschke, J. M. Borwein, and P. L. Combettes, “Bregman monotone optimization algorithms,” SIAM Journal on Control and Optimization, vol. 42, no. 2, pp. 596–636, 2003.

H. H. Bauschke and P. L. Combettes, “Construction of best Bregman approximations in reflexive Banach spaces,” Proceedings of the American Mathematical Society, vol. 131, no. 12, pp. 3757–3766, 2003.

R. S. Burachik, Generalized proximal point methods for the variational inequality problem, Ph.D. thesis, Instituto de Mathematica Pura e Aplicada (IMPA), Rio de Janeiro, Brazil, 1995.

R. S. Burachik and S. Scheimberg, “A proximal point method for the variational inequality problem in Banach spaces,” SIAM Journal on Control and Optimization, vol. 39, no. 5, pp. 1633–1649, 2000.

D. Butnariu and A. N. Iusem, Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization, vol. 40 of Applied Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000.

D. Butnariu, A. N. Iusem, and C. Zălinescu, “On uniform convexity, total convexity and convergence of the proximal point and outer Bregman projection algorithms in Banach spaces,” Journal of Convex Analysis, vol. 10, no. 1, pp. 35–61, 2003.

D. Butnariu and E. Resmerita, “Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces,” Abstract and Applied Analysis, vol. 2006, Article ID 84919, 39 pages, 2006.

J. W. Chen, Y. J. Cho, J. K. Kim, and J. Li, “Multiobjective optimization problems with modified objective functions and cone constraints and applications,” Journal of Global Optimization, vol. 49, no. 1, pp. 137–147, 2011.

J. Eckstein, “Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming,” Mathematics of Operations Research, vol. 18, no. 1, pp. 202–226, 1993.

K. C. Kiwiel, “Proximal minimization methods with generalized Bregman functions,” SIAM Journal on Control and Optimization, vol. 35, no. 4, pp. 1142–1168, 1997.

S. Reich, “A weak convergence theorem for the alternating method with Bregman distances,” in Theory and Applications of Nonlinear Operators of Accretive and Monotone Type, vol. 178 of Lecture Notes in Pure and Applied Mathematics, pp. 313–318, Dekker, New York, NY, USA, 1996.

E. Resmerita, “On total convexity, Bregman projections and stability in Banach spaces,” Journal of Convex Analysis, vol. 11, no. 1, pp. 1–16, 2004.

S. Reich and S. Sabach, “A strong convergence theorem for a proximal-type algorithm in reflexive Banach spaces,” Journal of Nonlinear and Convex Analysis, vol. 10, no. 3, pp. 471–485, 2009.

S. Reich and S. Sabach, “Two strong convergence theorems for a proximal method in reflexive Banach spaces,” Numerical Functional Analysis and Optimization, vol. 31, no. 1–3, pp. 22–44, 2010.

S. Reich and S. Sabach, “Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces,” Nonlinear Analysis: Theory, Methods & Applications, vol. 73, no. 1, pp. 122–135, 2010.

S. Reich and S. Sabach, “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, NY, USA, 2011.

S. Reich and S. Sabach, “A projection method for solving nonlinear problems in reflexive Banach spaces,” Journal of Fixed Point Theory and Applications. In press

M. V. Solodov and B. F. Svaiter, “An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions,” Mathematics of Operations Research, vol. 25, no. 2, pp. 214–230, 2000.

K. Nakajo and W. Takahashi, “Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups,” Journal of Mathematical Analysis and Applications, vol. 279, no. 2, pp. 372–379, 2003.

S. Matsushita and W. Takahashi, “A strong convergence theorem for relatively nonexpansive mappings in a Banach space,” Journal of Approximation Theory, vol. 134, no. 2, pp. 257–266, 2005.

J. W. Chen and Y. Z. Zou, “Existence of solutions of F-implicit variational inequality problems with extended projection operators,” Acta Mathematica Sinica. Chinese Series, vol. 53, no. 2, pp. 375–384, 2010.

C. Martinez-Yanes and H.-K. Xu, “Strong convergence of the CQ method for fixed point iteration processes,” Nonlinear Analysis: Theory, Methods & Applications, vol. 64, no. 11, pp. 2400–2411, 2006.

X. Qin and Y. Su, “Strong convergence theorems for relatively nonexpansive mappings in a Banach space,” Nonlinear Analysis: Theory, Methods & Applications, vol. 67, no. 6, pp. 1958–1965, 2007.

J. F. Bonnans and A. Shapiro, Perturbation Analysis of Optimization Problems, Springer Series in Operations Research, Springer, New York, NY, USA, 2000.

S. Plubtieng and K. Ungchittrakool, “Strong convergence theorems for a common fixed point of two relatively nonexpansive mappings in a Banach space,” Journal of Approximation Theory, vol. 149, no. 2, pp. 103–115, 2007.