Bregman distances, totally convex functions, and a method for solving operator equations in banach spaces

被引：263

作者：

Butnariu, Dan ^{[1
]}

Resmerita, Elena

机构：

[1] Univ Haifa, Dept Math, IL-31905 Haifa, Israel

[2] Austrian Acad Sci, Johann Radon Inst Computat & Appl Math, A-4040 Linz, Austria

来源：

ABSTRACT AND APPLIED ANALYSIS | 2006年

关键词：

D O I：

10.1155/AAA/2006/84919

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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 (c) 2006 D. Butnariu and E. Resmerita.

引用

页数：39

共 69 条

[1] Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces [J].