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

By Dan Butnariu, Elena Resmerita. 2006

304 citations recorded by the source corpus.

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.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/9df6869da189407c280ea5d293cb3ee33aca14cd

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Simeon Reich
  2. Shoham Sabach
  3. Victoria Martín-Márquez
  4. J. Vanderwerff
  5. Jonathan Michael Borwein
  6. Frank Schöpfer
  7. Tal Schuster
  8. Mostafa Nasri

In Geometry and Topology

  1. Simeon Reich
  2. Shoham Sabach
  3. J. Vanderwerff
  4. Victoria Martín-Márquez
  5. Jonathan Michael Borwein
  6. Alfredo Noel Iusem
  7. Tal Schuster
  8. Alfred K. Louis

In Numerical Analysis

  1. Simeon Reich
  2. Shoham Sabach
  3. Victoria Martín-Márquez
  4. Tal Schuster
  5. Frank Schöpfer
  6. Mostafa Nasri
  7. J. Vanderwerff
  8. Jonathan Michael Borwein

Citations in the corpus