A new halfspace-relaxation projection method for the split feasibility problem

被引:59
作者
Qu, Biao [1 ,2 ]
Xiu, Naihua [1 ]
机构
[1] Beijing Jiao Tong Univ, Dept Appl Math, Beijing 100044, Peoples R China
[2] Qufu Normal Univ, Inst Operat Res, Shandong 276826, Peoples R China
基金
中国国家自然科学基金;
关键词
the split feasibility problem; halfspace-relaxation projection method; fully convergent;
D O I
10.1016/j.laa.2007.03.002
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let C and Q be nonempty closed convex sets in R-n and R-m respectively, and A an m x n real matrix. The problem, to find x is an element of C with Ax is an element of Q if such x exist, is called the split feasibility problem (SFP). This problem is important in intensity-modulated radiation therapy, signal processing, image reconstruction and so on. In this paper, based on a new reformulation for the SFP, we propose a new halfspace-relaxation projection method for the SFP. The method is implemented very easily and is proven to be fully convergent to the solution for the case where the solution set of the SFP is nonempty. Preliminary computational experience is also reported. (C) 2007 Elsevier Inc. All rights reserved.
引用
收藏
页码:1218 / 1229
页数:12
相关论文
共 16 条
[1]   Projection algorithms for solving convex feasibility problems [J].
Bauschke, HH ;
Borwein, JM .
SIAM REVIEW, 1996, 38 (03) :367-426
[3]   A unified treatment of some iterative algorithms in signal processing and image reconstruction [J].
Byrne, C .
INVERSE PROBLEMS, 2004, 20 (01) :103-120
[4]  
BYRNE CL, 2001, INHERENTLY PARALLEL, P87, DOI DOI 10.1016/S1570-579X(01)80008-2
[5]  
Censor Y., 1994, Numer. Algor, V8, P221, DOI [10.1007/BF02142692, DOI 10.1007/BF02142692]
[6]   A unified approach for inversion problems in intensity-modulated radiation therapy [J].
Censor, Yair ;
Bortfeld, Thomas ;
Martin, Benjamin ;
Trofimov, Alexei .
PHYSICS IN MEDICINE AND BIOLOGY, 2006, 51 (10) :2353-2365
[7]   A RELAXED PROJECTION METHOD FOR VARIATIONAL-INEQUALITIES [J].
FUKUSHIMA, M .
MATHEMATICAL PROGRAMMING, 1986, 35 (01) :58-70
[8]  
Gafni E. M., 1984, Math. Programming, V53, P99
[9]  
He BS, 1997, APPL MATH OPT, V35, P69
[10]  
Polyak BT., 1969, USSR COMP MATH MATH, V9, P14, DOI [10.1016/0041-5553(69)90061-5, DOI 10.1016/0041-5553(69)90061-5]