Finding projections onto the intersection of convex sets in hilbert spaces
Publication:4845181
DOI10.1080/01630569508816636zbMath0827.46017OpenAlexW2113058175MaRDI QIDQ4845181
Publication date: 4 September 1995
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569508816636
weightsrelaxation coefficientparallel iterative methodclosed convex sets in a real Hilbert spaceshortest distance projection
General theory of numerical analysis in abstract spaces (65J05) Computing methodologies for image processing (68U10) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Methods of category theory in functional analysis (46M99)
Related Items (8)
Cites Work
- Unnamed Item
- Relaxed outer projections, weighted averages and convex feasibility
- A cyclic projection algorithm via duality
- On the convergence of Han's method for convex programming with quadratic objective
- A successive projection method
- Image recovery by convex combinations of projections
- Weak and norm convergence of a parallel projection method in Hilbert spaces
This page was built for publication: Finding projections onto the intersection of convex sets in hilbert spaces