Solving stochastic convex feasibility problems in hilbert spaces (Q4354840)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1062175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving stochastic convex feasibility problems in hilbert spaces |
scientific article; zbMATH DE number 1062175 |
Statements
Solving stochastic convex feasibility problems in hilbert spaces (English)
0 references
27 October 1997
0 references
stochastic convex feasibility problems
0 references
expected-projection methods
0 references
almost common point
0 references
0 references
0.92275804
0 references
0.9141378
0 references
0.9067429
0 references
0.9063593
0 references
0.90236044
0 references
The author investigates the following stochastic convex feasibility problem: for a complete space \((\Omega,A,\mu)\) and a family of closed convex sets \(\{C_\omega\}_{\omega\in \Omega}\) in a real Hilbert space, find a point that belongs to \(C_\omega\) for \(\mu\)-almost all \(\omega\in \Omega\). The author presents a projection-based method where the variable relaxation parameter is defined by a geometrical condition, leading to an iteration sequence that is always weakly convergent to a \(\mu\)-almost common point. Then, under a general condition about the sets \(C_\omega\), the constructed sequence is proved to be norm-convergent to a \(\mu\)-almost common point.
0 references