Finding projections onto the intersection of convex sets in hilbert spaces

DOI10.1080/01630569508816636zbMATH Open0827.46017OpenAlexW2113058175MaRDI QIDQ4845181FDOQ4845181

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1174427
• Weak and norm convergence of a parallel projection method in Hilbert spaces
• Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
• A parallel projection method based on sequential most remote set in convex feasibility problems
• scientific article; zbMATH DE number 3973706

zbMATH Keywords

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

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) General theory of numerical analysis in abstract spaces (65J05) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Methods of category theory in functional analysis (46M99)

Cites Work

• A cyclic projection algorithm via duality
• On the convergence of Han's method for convex programming with quadratic objective
• A successive projection method
• Relaxed outer projections, weighted averages and convex feasibility
• Title not available (Why is that?)
• Image recovery by convex combinations of projections
• Weak and norm convergence of a parallel projection method in Hilbert spaces

Cited In (19)

• A new projection method for finding the closest point in the intersection of convex sets
• Projections onto closed convex sets in Hilbert spaces
• Computational acceleration of projection algorithms for the linear best approximation problem
• Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
• Projections onto hyperbolas or bilinear constraint sets 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
• Title not available (Why is that?)
• A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
• Fundamentals of cone regression
• Hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in Banach spaces
• A parallel projection method based on sequential most remote set in convex feasibility problems
• A method to find a point of a convex set
• Projection on the intersection of convex sets
• Iterative approaches to convex feasibility problems in Banach spaces
• Solving stochastic convex feasibility problems in hilbert spaces
• On projection reflection method in Hilbert spaces
• Iterations of parallel convex projections in hilbert spaces
• Projections onto convex cones in Hilbert space

This page was built for publication: Finding projections onto the intersection of convex sets in hilbert spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845181)