On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space (Q1272854)
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: On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space |
scientific article; zbMATH DE number 1228535
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space |
scientific article; zbMATH DE number 1228535 |
Statements
On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space (English)
0 references
6 July 1999
0 references
A sequence \((x_n)\) in a Hilbert space is called to be ``spherical'' if there exists \(u\) such that \(\lim | | x_n-u| | \) exists and is finite. It is shown that for a large class of nonexpansive discrete-time processes in a Hilbert space, the iterates \((x_n)\) are spherically convergent. Spherical convergence of the general block iterative projection scheme is established.
0 references
projection methods
0 references
convex sets
0 references
weak convergence
0 references
nonexpansive discrete-time processes
0 references
block iterative projection scheme
0 references
0 references
0 references
0 references
0 references
0.9200209
0 references
0.8999916
0 references
0.89611244
0 references
0.8903885
0 references
0.8867084
0 references
0.8820131
0 references
0.87939394
0 references
0.8793775
0 references
0.8788167
0 references
