Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
<p>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...
Saved in:
| Format: | Article |
|---|---|
| Language: | English |
| Published: |
Wiley
2006-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://www.hindawi.com/GetArticle.aspx?doi=10.1155/AAA/2006/84919 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | <p>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.</p> |
|---|---|
| ISSN: | 1085-3375 |