An adaptive block iterative CQ algorithm of furthest projection

DOI10.11826/J.ISSN.1000-5854.2014.06.006MaRDI QIDQ5260070zbMATH OpenFDO

Authors Gang Li, Pei-Yuan Wang, Haiyun Zhou

Publication date 29 June 2015

Full work available at URL https://doi.org/10.11826/J.ISSN.1000-5854.2014.06.006

zbMATH Keywords

convergenceCQ algorithmadaptionblock iterationCT image reconstructionArmijo-like search methodsfurthest block projection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Biomedical imaging and signal processing (92C55) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Iterative oblique projection onto convex sets and the split feasibility problem
• Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
• scientific article; zbMATH DE number 1860707
• Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
• The application of CQ algorithm under different convex sets

Cited in

(1)

• An optimum block adaptive algorithm based on the nested iteration technique

This page was built for publication: An adaptive block iterative CQ algorithm of furthest projection

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