Finding projections onto the intersection of convex sets in hilbert spaces

DOI10.1080/01630569508816636zbMath0827.46017OpenAlexW2113058175MaRDI QIDQ4845181

Gilbert Crombez

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

zbMATH Keywords

weightsrelaxation coefficientparallel iterative methodclosed convex sets in a real Hilbert spaceshortest distance projection

Mathematics Subject Classification ID

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

Fundamentals of cone regression ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ Solving stochastic convex feasibility problems in hilbert spaces ⋮ Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings ⋮ Quadratic optimization of fixed points of nonexpansive mappings in hubert space ⋮ Iterative approaches to convex feasibility problems in Banach spaces ⋮ Computational acceleration of projection algorithms for the linear best approximation problem ⋮ Hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in Banach spaces

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