bregman distances, totally convex functions, and a method for solving operator equations in banach spaces师的距离,完全凸函数,解算子方程的一种方法,在巴拿赫空间.pdfVIP

BREGMAN DISTANCES, TOTALLY CONVEX FUNCTIONS, AND A METHOD FOR SOLVING OPERATOR EQUATIONS IN BANACH SPACES DAN BUTNARIU AND ELENA RESMERITA Received 25 July 2004; Accepted 6 April 2005 The aim of this paper is twofold. First, several basic mathematical concepts involved in the construction and study of Bregman type iterative algorithms are presented from a unified analytic perspective. Also, some gaps in the current knowledge about those concepts are filled in. Second, we employ existing results on total convexity, sequential consistency, uniform convexity and relative projections in order to define and study the convergence of a new Bregman type iterative method of solving operator equations. Copyright © 2006 D. Butnariu and E. Resmerita. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, dis- tribution, and reproduction in any medium, provided the original work is properly cited. 1. Introduction Let X be a Banach space and f : X → (−∞,+∞] be a proper convex function. For any x ∈ domf and z ∈ X we denote by f ◦ (x,z ) the right-hand side derivative of f at x in the direction z, that is, ◦ f (x + tz) −f (x ) f (x,z ) = lim . (1.1) t0 t The function Df : domf × domf → [0,+∞] given by Df (y ,x ) := f (y ) −f (x ) −f ◦ (x,y −x ) (1.2) is called the Bregman distance with respect to f . Lev Bregman [20] has discovered an el- egant and effective technique for the use of the function Df in the process of designing and analyzing feasibility and optimization algorithms. This opened a growing area of re- search in which Bregman’s technique is applied in various ways in order to design and analyze ite