zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Construction of best Bregman approximations in reflexive Banach spaces. (English) Zbl 1040.41016

Let X be a reflexive Banach space and let f:X(-,] be a lower semicontinuous convex function which is Gâteaux differentiable on intdomf. Assume further that f is both locally bounded and single-valued on its domain and (f) -1 is locally bounded on its domain, f is strictly convex on every convex subset of domf. The Bregman distance associated with f is the function D:X×X[0,] defined by D(x,y)=f(x)-f(y)-(x-y,f(y)) if yintdomf and as otherwise. Let x 0 intdomf, (intdomf)S i , and S=dom ¯fS i where {S i } iI is a countable family of closed and convex subsets of X.

In this paper the authors present a method for finding the best Bregman approximation to x 0 from S. A renorming result that the authors attribute to Professor J. D. Vanderwerff, saying that any reflexive space can be equivalently renormed so that in the new norm the space is strictly convex, Gâteaux smooth but fails to have the Kadec-Klee property will also be of interest to a general reader.

MSC:
41A65Abstract approximation theory
41A29Approximation with constraints
41A50Best approximation, Chebyshev systems