Parallel and cyclic algorithms for quasi-nonexpansives in Hilbert space (Q696016)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel and cyclic algorithms for quasi-nonexpansives in Hilbert space |
scientific article; zbMATH DE number 6116348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel and cyclic algorithms for quasi-nonexpansives in Hilbert space |
scientific article; zbMATH DE number 6116348 |
Statements
Parallel and cyclic algorithms for quasi-nonexpansives in Hilbert space (English)
0 references
18 December 2012
0 references
Summary: Let \(\{T\}^N_{i=1}\) be \(N\) quasi-nonexpansive mappings defined on a closed convex subset \(C\) of a real Hilbert space \(H\). Consider the problem of finding a common fixed point of these mappings and introduce the parallel and cyclic algorithms for solving this problem. We will prove the strong convergence of these algorithms.
0 references
quasi-nonexpansive mappings
0 references
parallel algorithms
0 references
cyclic algorithms
0 references
0 references
0 references
0 references
0 references
0.8929103016853333
0 references
0.8822710514068604
0 references
0.8685581684112549
0 references
0.853338897228241
0 references
