Iterative methods for approximating fixed points of Bregman nonexpansive operators

Diverse notions of nonexpansive type operators have been extended to the more general framework of Bregman distances in reflexive Banach spaces. We study these classes of operators, mainly with respect to the existence and approximation of their (asymptotic) fixed points. In particular, the asymptotic behavior of Picard and Mann type iterations is discussed for quasi-Bregman nonexpansive operators. We also present parallel algorithms for approximating common fixed points of a finite family of Bregman strongly nonexpansive operators by means of a block operator which preserves the Bregman strong nonexpansivity. All the results hold, in particular, for the smaller class of Bregman firmly nonexpansive operators, a class which contains the generalized resolvents of monotone mappings with respect to the Bregman distance.

[1]  Shoham Sabach,et al.  Iterative Methods for Solving Systems of Variational Inequalities in Reflexive Banach Spaces , 2011, SIAM J. Optim..

[2]  Heinz H. Bauschke,et al.  Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.

[3]  S. Reich,et al.  Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces , 2010 .

[4]  C. E. Chidume,et al.  Geometric Properties of Banach Spaces and Nonlinear Iterations , 2009 .

[5]  V. Berinde.  Iterative Approximation of Fixed Points , 2007 .

[6]  Dan Butnariu,et al.  Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces , 2006 .

[7]  Heinz H. Bauschke,et al.  Projection and proximal point methods: convergence results and counterexamples , 2004 .

[8]  Heinz H. Bauschke,et al.  Bregman Monotone Optimization Algorithms , 2003, SIAM J. Control. Optim..

[9]  Heinz H. Bauschke,et al.  ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES , 2001 .

[10]  A. Iusem,et al.  Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization , 2000 .

[11]  J. Frédéric Bonnans,et al.  Perturbation Analysis of Optimization Problems , 2000, Springer Series in Operations Research.

[12]  Yair Censor,et al.  Iterative Averaging of Entropic Projections for Solving Stochastic Convex Feasibility Problems , 1997, Comput. Optim. Appl..

[13]  Yair Censor,et al.  Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces , 1994 .

[14]  Y. Censor,et al.  Block-iterative projection methods for parallel computation of solutions to convex feasibility problems , 1989 .

[15]  S. Reich,et al.  Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings , 1984 .

[16]  M. A. Krasnoselʹskii,et al.  Geometrical Methods of Nonlinear Analysis , 1984 .

[17]  Y. Censor.  Row-Action Methods for Huge and Sparse Systems and Their Applications , 1981 .

[18]  Y. Censor,et al.  An iterative row-action method for interval convex programming , 1981 .

[19]  S. Reich.  Weak convergence theorems for nonexpansive mappings in Banach spaces , 1979 .

[20]  J. Lindenstrauss,et al.  An example concerning fixed points , 1975 .

[21]  W. R. Mann,et al.  Mean value methods in iteration , 1953 .

[22]  Shoham Sabach,et al.  Existence and Approximation of Fixed Points of Bregman Firmly Nonexpansive Mappings in Reflexive Banach Spaces , 2011, Fixed-Point Algorithms for Inverse Problems in Science and Engineering.

[23]  Jonathan M. Borwein,et al.  A Characterization of Bregman Firmly Nonexpansive Operators Using a New Monotonicity Concept , 2011 .

[24]  Z. Ésik.  Fixed Point Theory , 2009 .

[25]  Y. Censor,et al.  Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization , 1996 .

[26]  A. Kartsatos.  Theory and applications of nonlinear operators of accretive and monotone type , 1996 .

[27]  Nonlinear functional analysis and its applications, part I: Fixed-point theorems , 1991 .

[28]  L. Bregman.  The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming , 1967 .