zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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)
Surrogate projection methods for finding fixed points of firmly nonexpansive mappings. (English) Zbl 0905.47044
Summary: We present methods for finding common fixed points of finitely many firmly nonexpansive mappings on a Hilbert space. At every iteration, an approximation to each mapping generates a halfspace containing its set of fixed points. The next iterate is found by projecting the current iterate on a surrogate halfspace formed by taking a convex combination of the halfspace inequalities. This acceleration technique extends one for convex feasibility problems (CFPs), since projection operators onto closed convex sets are firmly nonexpansive. The resulting methods are block iterative and, hence, lend themselves to parallel implementation. We extend to accelerated methods some recent results of {\it H. H. Bauschke} and {\it J. M. Borwein} [SIAM Rev. 38, No. 3, 367-426 (1996; Zbl 0865.47039)] on the convergence of projection methods.

47H09Mappings defined by “shrinking” properties
47J25Iterative procedures (nonlinear operator equations)
90C25Convex programming
47H10Fixed-point theorems for nonlinear operators on topological linear spaces
65J15Equations with nonlinear operators (numerical methods)
Full Text: DOI