3 papers
math.OC2023
The alternating simultaneous Halpern-Lions-Wittmann-Bauschke algorithm for finding the best approximation pair for two disjoint intersections of convex sets
Yair Censor, Rafiq Mansour, Daniel Reem
Given two nonempty and disjoint intersections of closed and convex subsets, we look for a best approximation pair relative to them, i.e., a pair of points, one in each intersection…
math.OC2017
Convergence Analysis of Processes with Valiant Projection Operators in Hilbert Space
Yair Censor, Rafiq Mansour
Convex feasibility problems require to find a point in the intersection of a finite family of convex sets. We propose to solve such problems by performing set-enlargements and appl…
math.OC2015
New Douglas-Rachford algorithmic structures and their convergence analyses
Yair Censor, Rafiq Mansour
In this paper we study new algorithmic structures with Douglas- Rachford (DR) operators to solve convex feasibility problems. We propose to embed the basic two-set-DR algorithmic o…