Solving stochastic convex feasibility problems in hilbert spaces
From MaRDI portal
Publication:4354840
DOI10.1080/01630569608816731zbMath0880.65025MaRDI QIDQ4354840
Publication date: 27 October 1997
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569608816731
65J05: General theory of numerical analysis in abstract spaces
46C05: Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product)
60H25: Random operators and equations (aspects of stochastic analysis)
65C99: Probabilistic methods, stochastic differential equations
Cites Work
- Unnamed Item
- Decomposition through formalization in a product space
- Iterations of parallel convex projections in hilbert spaces
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- An Adaptive Parallel Projection Method for Solving Convex Feasibility Problems
- Finding projections onto the intersection of convex sets in hilbert spaces
- Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
- The method of projections for finding the common point of convex sets