Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

Author:
Abdellah Bnouhachem   Muhammad Aslam Noor   Mohamed Khalfaoui  


Issue Date:
2012


Abstract(summary):

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


Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads