On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space (Q1272854): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:46, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space |
scientific article |
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
