Finding projections onto the intersection of convex sets in hilbert spaces
- 1 January 1995
- journal article
- research article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 16 (5) , 637-652
- https://doi.org/10.1080/01630569508816636
Abstract
We present a parallel iterative method to find the shortest distance projection of a given point onto the intersection of a finite number of closed convex sets in a real Hilbert space. In the method use is made of weights and a relaxation coefficient which may vary at each iteration step, and which are determined at each step by geometrical conditions.Keywords
This publication has 11 references indexed in Scilit:
- Weak and norm convergence of a parallel projection method in Hilbert spacesApplied Mathematics and Computation, 1993
- Signal recovery by best feasible approximationIEEE Transactions on Image Processing, 1993
- The foundations of set theoretic estimationProceedings of the IEEE, 1993
- On the convergence of Han's method for convex programming with quadratic objectiveMathematical Programming, 1991
- Image recovery by convex combinations of projectionsJournal of Mathematical Analysis and Applications, 1991
- Relaxed outer projections, weighted averages and convex feasibilityBIT Numerical Mathematics, 1990
- A cyclic projection algorithm via dualityMetrika, 1989
- A successive projection methodMathematical Programming, 1988
- A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert SpacesPublished by Springer Nature ,1986
- Eclatement de contraintes en parallele pour la minimisation d'une forme quadratiqueLecture Notes in Computer Science, 1976