2 problems

Consider the Douglas–Rachford algorithm for the conic feasibility problem in which $f$ is the indicator function of a linear subspace and $g$ is the indicator function of the non-n…

Let $f$ and $g$ be the indicator functions of closed convex cones, and suppose that the relative interiors of the two cones have a nonempty intersection. Finite termination conject…