The application of CQ algorithm under different convex sets

MaRDI QIDQ5165811zbMATH OpenFDO

Authors Pei-Yuan Wang, Haiyun Zhou

Publication date 30 June 2014

zbMATH Keywords

image reconstructionsplit feasibility problemCQ algorithmnonempty convex set

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Iterative oblique projection onto convex sets and the split feasibility problem
• Convergence of the modified CQ algorithm and its application in split feasibility problem
• scientific article; zbMATH DE number 6025203
• The relaxed CQ algorithm solving the split feasibility problem
• Alternating CQ-algorithms for convex feasibility and split fixed-point problems

Cited in

(3)

• An adaptive block iterative CQ algorithm of furthest projection
• (CQ) algorithm implementation
• Partial simulation of (CQ) algorithm

This page was built for publication: The application of CQ algorithm under different convex sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5165811)