Convergence rate of the CQ algorithm for split feasibility problems

MaRDI QIDQ5114262zbMATH OpenFDO

Authors Peipei Chen, Hongjin He, Yeong-Cheng Liou, Ching-Feng Wen

Publication date 22 June 2020

Full work available at URL http://www.yokohamapublishers.jp/online2/opjnca/vol19/p381.html

zbMATH Keywords

accelerationCQ algorithmimage deblurringiteration complexitysplit feasibility problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Programming involving graphs or networks (90C35)

Recommendations

• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• Convergence of the modified CQ algorithm and its application in split feasibility problem
• Iterative oblique projection onto convex sets and the split feasibility problem
• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem

Cited in

(4)

• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• scientific article; zbMATH DE number 6025203 (Why is no real title available?)
• Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property

This page was built for publication: Convergence rate of the CQ algorithm for split feasibility problems

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