Yuting Shen (沈雨婷)

Feasibility problem aims to find a common point of two or more closed (convex) sets whose intersection is nonempty. In the literature, projection based algorithms are widely adopted to solve the problem, such as the method of alternating projection (MAP), and Douglas–Rachford splitting method (DR). The performance of the methods are governed by the geometric properties of the underlying sets. For example, the fixed-point sequence of the Douglas–Rachford splitting method exhibits a spiraling behavior when solving the feasibility problem of two subspaces, leading to a slow convergence speed and slower than MAP. However, when the problem at hand is non-polyhedral, DR can demonstrate significant faster performance. Motivated by the behaviors of the DR method, in this paper we propose a new algorithm for solving convex feasibility problems. The method is designed based on DR method by further incorporating a composition of projection and reflection. A non-stationary version of the method is also designed, aiming to achieve faster practical performance. Theoretical guarantees of the proposed schemes are provided and supported by numerical experiments.