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

Biao Qu,Naihua Xiu

doi:10.1016/j.laa.2007.03.002

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

Biao Qu, Naihua Xiu

Open Access

https://doi.org/10.1016/j.laa.2007.03.002

Copy DOI

Journal: Linear Algebra and Its Applications	Publication Date: Mar 24, 2007
Citations: 58	License type: elsevier-specific: oa user license

Affiliation: Qufu Normal University, Beijing Jiaotong University

#Split Feasibility Problem #Nonempty Closed Convex Sets + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

Let C and Q be nonempty closed convex sets in R n and R m , respectively, and A an m by n real matrix. The problem, to find x ∈ C with Ax ∈ 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.

Full Text