Abstract
The aim of this paper is twofold. First, several basicmathematical concepts involved in the construction and study ofBregman type iterative algorithms are presented from a unifiedanalytic perspective. Also, some gaps in the current knowledgeabout those concepts are filled in. Second, we employ existingresults on total convexity, sequential consistency, uniformconvexity and relative projections in order to define and studythe convergence of a new Bregman type iterative method of solvingoperator equations.
| Original language | English |
|---|---|
| Article number | 84919 |
| Journal | Abstract and Applied Analysis |
| Volume | 2006 |
| DOIs | |
| State | Published - 2006 |
ASJC Scopus subject areas
- Analysis
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver