Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces
- 31 October 2003
- journal article
- Published by Elsevier BV in Journal of Approximation Theory
- Vol. 124 (2), 194-218
- https://doi.org/10.1016/j.jat.2003.08.004
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Construction of best Bregman approximations in reflexive Banach spacesProceedings of the American Mathematical Society, 2003
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert SpacesMathematics of Operations Research, 2001
- Dykstras algorithm with bregman projections: A convergence proofOptimization, 2000
- On Projection Algorithms for Solving Convex Feasibility ProblemsSIAM Review, 1996
- The Approximation of Fixed Points of Compositions of Nonexpansive Mappings in Hilbert SpaceJournal of Mathematical Analysis and Applications, 1996
- Dykstra′s Alternating Projection Algorithm for Two SetsJournal of Approximation Theory, 1994
- A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert SpacesPublished by Springer Science and Business Media LLC ,1986
- An interior points algorithm for the convex feasibility problemAdvances in Applied Mathematics, 1983
- An iterative row-action method for interval convex programmingJournal of Optimization Theory and Applications, 1981
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967