Bregman distances, totally convex functions and a method for solving operator equations in Banach spaces
Dan Butnariu (dbutnarumath.haifa.ac.il)
Abstract: 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.
Keywords: Bregman distance, Bregman projection, relative projection, total convexity, essential strict convexity, E-space, Mosco convergence, uniform convexity, inverse monotone operator, inverse strongly-monotone operator.
Category 1: Convex and Nonsmooth Optimization
Citation: submitted, 2004
Entry Submitted: 01/16/2005
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|