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. Copyright © 2006 D. Butnariu and E. Resmerita.
Cite
CITATION STYLE
Butnariu, D., & Resmerita, E. (2006). Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces. Abstract and Applied Analysis, 2006. https://doi.org/10.1155/AAA/2006/84919
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.