An Improved Alternating CQ Algorithm for Solving Split Equality Problems

Yan-Juan He, Li-Jun Zhu and Nan-Nan Tan
Additional contact information
Yan-Juan He: School of Mathematics and Information Science, North Minzu University, Yinchuan 750021, China
Li-Jun Zhu: The Key Laboratory of Intelligent Information and Big Data Processing of Ningxia Province, North Minzu University, Yinchuan 750021, China
Nan-Nan Tan: School of Mathematics and Information Science, North Minzu University, Yinchuan 750021, China

Mathematics, 2021, vol. 9, issue 24, 1-10

Abstract: The CQ algorithm is widely used in the scientific field and has a significant impact on phase retrieval, medical image reconstruction, signal processing, etc. Moudafi proposed an alternating CQ algorithm to solve the split equality problem, but he only obtained the result of weak convergence. The work of this paper is to improve his algorithm so that the generated iterative sequence can converge strongly.

Keywords: split equality problem; alternating CQ algorithm; strong convergence; split feasibility problem (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/24/3313/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/24/3313/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:24:p:3313-:d:706165

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().