Association Journal of CSIAM
Supervised by Ministry of Education of PRC
Sponsored by Xi'an Jiaotong University
ISSN 1005-3085  CN 61-1269/O1
Chinese Journal of Engineering Mathematics

Chinese Journal of Engineering Mathematics ›› 2015, Vol. 32 ›› Issue (2): 298-306.doi: 10.3969/j.issn.1005-3085.2015.02.014

Previous Articles     Next Articles

Two Strongly Convergent CQ Algorithms for Split Feasibility Problem

DANG Ya-zheng1,   XUE Zhong-hui2,   GAO Yan1   

  1. 1- School of Management, University of Shanghai for Science and Technology, Shanghai 200093
    2- School of Physics and Chemistry, Henan Polytechnic University, Jiaozuo 454001
  • Received:2013-07-14 Accepted:2014-09-01 Online:2015-04-15 Published:2015-06-15
  • Supported by:
    The National Natural Science Foundation of China (11171221; 61403255); the Doctoral Program Foundation of Institutions of Higher Education of China (20123120110004); the China Coal Industry Association 2011 Annual Scientific and Technical Guidance Programs (MTKJ-2011-404); the Natural Science Foundation of Shanghai (14ZR1429200); the Shanghai Leading Academic Discipline Project (XTKX2012); the Innovation Program of Shanghai Municipal Education Commission (15ZZ073); the Doctoral Starting Projection of the University of Shanghai for Science and Technology (ID-10-303-002); the Young Teacher Training Projection Program of Shanghai for Science and Technology. 

PDF (PC)

2

Abstract:

In thins paper, in order to ensure the strong convergence of the iterative procedure for solving split feasibility problem in a real Hilbert space. We firstly construct a modified CQ algorithm by introducing three parametric sequences and prove its strong convergence under some weak conditions. Furthermore, we put another parametric sequence in one operator in the presented algorithm to get a new algorithm, and also prove its strong convergence under some conditions on the parametric sequence. The results in this paper improve and extend the corresponding results.

Key words: split feasibility problem, modified CQ algorithm, strong convergence

CLC Number: