Choices of variable steps of the CQ algorithm for the split feasibility problem

Fenghui Wang, Hong Kun Xu, Meng Su

Research output: Contribution to journalArticle

9 Scopus citations

Abstract

We consider the CQ algorithm, with choice of steps introduced by Yang (J. Math. Anal. Appl. 302 (2005), 166-179), for solving the split feasibility problem (SFP): Find x Ie{cyrillic, ukrainian} C such that Ax Ie{cyrillic, ukrainian} Q, where C and Q are nonempty closed convex subsets of ℝn and ℝm, respectively, and A is an m × n matrix. We convert the SFP to an equivalent convexly constrained nonlinear system of finding a zero in C of an inverse strongly monotone operator, which enables us to introduce new convergent iterative algorithms. Two restrictive conditions of Yang (i.e., the boundedness of Q and the full column rank of A) are completely removed in our new algorithms.

Original languageEnglish (US)
Pages (from-to)489-496
Number of pages8
JournalFixed Point Theory
Volume12
Issue number2
StatePublished - Nov 3 2011

All Science Journal Classification (ASJC) codes

  • Analysis
  • Computational Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Choices of variable steps of the CQ algorithm for the split feasibility problem'. Together they form a unique fingerprint.

  • Cite this