Strongly convergent ball-relaxed CQ algorithm and its application

DOI10.15960/J.CNKI.ISSN.1007-6093.2021.01.004MaRDI QIDQ5153442zbMATH OpenFDO

Authors Hai Yu, Wan-rong Zhan

Publication date 29 September 2021

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2021.01.004

zbMATH Keywords

CQ algorithmsplit feasibility problemstrong convergencestrongly convex function

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• The ball-relaxed CQ algorithms for the split feasibility problem
• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• The ball-relaxed gradient-projection algorithm for split feasibility problem
• A splitting-relaxed projection method for solving the split feasibility problem
• The relaxed CQ algorithm solving the split feasibility problem

Cited in

(2)

• Strong convergence of alternated inertial \(CQ\) relaxed method with application in signal recovery
• The ball-relaxed gradient-projection algorithm for split feasibility problem

This page was built for publication: Strongly convergent ball-relaxed CQ algorithm and its application

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