## 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 language | English (US) |
---|---|

Pages (from-to) | 489-496 |

Number of pages | 8 |

Journal | Fixed Point Theory |

Volume | 12 |

Issue number | 2 |

State | Published - Nov 3 2011 |

## All Science Journal Classification (ASJC) codes

- Analysis
- Computational Mathematics
- Applied Mathematics