Let and C be nonempty, closed and convex sets in Rnand Rmrespectively and A be an m × n real matrix. The split feasibility problem is to find u ∈ with Au ∈ C. Many problems arising in the image reconstruction can be formulated in this form. In this paper, weproposeadescent-projectionmethodforsolvingthesplitfeasibilityproblems. The method generates the new iterate by searching the optimal step size along the descent direc tion. Under certain conditions, the global convergence of the proposed method is proved. In order to demonstrate the efficiency of the proposed method, we provide some numerical results.
Page:
13
Related
Batch download
Cited By
noting
Similar Literature
Submit Feedback
Please wait while the file you selected is being converted