296
Views
6
CrossRef citations to date
0
Altmetric
Articles

A Bregman projection method for approximating fixed points of quasi-Bregman nonexpansive mappings

, &
Pages 75-84 | Received 25 Sep 2013, Accepted 18 Nov 2013, Published online: 21 Jan 2014

References

  • Bauschke HH, Borwein JM. On projection algorithms for solving convex feasibility problems. SIAM Rev. 1996;38:367–426.
  • Bauschke HH, Borwein JM. Legendre functions and the method of random Bregman projections. J. Convex Anal. 1997;4:27–67.
  • Bauschke HH, Borwein JM, Combettes PL. Essential smoothness, essential strict convexity, and Legendre functions in Banach spaces. Commun. Contemp. Math. 2001;3:615–647.
  • Bauschke HH, Borwein JM, Combettes PL. Bregman monotone optimization algorithms. SIAM J. Control Optim. 2003;42:596–636.
  • Bauschke HH, Chen J, Wang X. A projection method for approximating fixed points of quasi nonexpansive mappings without the usual demiclosedness condition. J. Nonlinear Convex Anal. in press.
  • Bauschke HH, Combettes PL. Construction of best Bregman approximation in reflexive Banach spaces. Proc. Amer. Math. Soc. 2003;131:3757–3766.
  • Bauschke HH, Combettes PL. Iterating Bregman retraction. SIAM J. Optim. 2003;13:1159–1173.
  • Bauschke HH, Combettes PL. Convex analysis and monotone operator theory in Hilbert spaces. New York (NY): Springer; 2011.
  • Bauschke HH, Noll D. The method of forward projection. J. Nonlinear Convex Anal. 2002;3:191–205.
  • Bregman LM. The relaxation method for finding common points of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 1967;7:200–217.
  • Butnariu D, Iusem AN. Totally convex functions for fixed points computation and infinite dimensional optimization, applied optimization. Vol. 40. Dordrecht: Kluwer Academic; 2000.
  • Butnariu D, Resmerita E. Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces. Abstr. Appl. Anal. 2006;84919: 39 pp.
  • Censor Y, Reich S. The Dykstra algorithm with Bregman projections. Commun. Appl. Anal. 1998;2:407–419.
  • Censor Y, Zenios SA. Parallel optimization. New York (NY): Oxford University Press; 1997.
  • Kassay G, Reich S, Sabach S. Iterative methods for solving systems of variational inequalities in reflexive Banach spaces. SIAM J. Optim. 2011;21:1319–1344.
  • Mordukhovich BS. Variational analysis and generalized differentiation I. New York (NY): Springer; 2006.
  • Reich S, Sabach S. A projection method for solving nonlinear problems in reflexive Banach spaces. J. Fixed Point Theory Appl. 2011;9:101–116.
  • Reich S, Sabach S. Existence and approximation of fixed points of Bregman firmly nonexpansive operators in reflexive Banach spaces. In: Fixed-point algorithms for inverse problems in science and engineering, optimization and its applications. New York (NY): Springer; 2011. p. 301–316.
  • Rockafellar RT. Convex analysis. Princeton (NJ): Princeton University Press; 1970.
  • Zălinescu C. Convex analysis in general vector spaces. River Edge (NJ): World Scientific; 2002.
  • Sabach S. Products of finitely many resolvents of maximal monotone mappings in reflexive Banach spaces. SIAM J. Optim. 2011;21:1289–1308.
  • Rockafellar RT, Wets RJ-B. Variational analysis, corrected 3rd printing. Berlin: Springer; 2009.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.