Alternating CQ-Algorithms For Convex Feasibility And Split Fixed-Point Problems
Abdellatif Moudafi · RePEc: Research Papers in Economics · 2013
Due to their extraordinary utility and broad applicability in many areas of applied mathematics (most notably, fully-discretized models of problems in image reconstruction from projections, in image processing, and in intensity-modulated radiation therapy), algorithms for solving convex feasibility problems continue to receive great attention.