Prefer a chat interface with context about you and your work?
The regularized CQ algorithm without a priori knowledge of operator norm for solving the split feasibility problem
The split feasibility problem (SFP) is finding a point [Formula: see text] such that [Formula: see text], where C and Q are nonempty closed convex subsets of Hilbert spaces [Formula: see text] and [Formula: see text], and [Formula: see text] is a bounded linear operator. Byrne's CQ algorithm is an …