On descent-projection method for solving the split feasibility problems

Author Info

• Abdellah Bnouhachem

()

()

• Mohamed Khalfaoui
• Sheng Zhaohan
Registered author(s):

Abstract

Let Ω and C be nonempty, closed and convex sets in R n and R m respectively and A be an $${m \times n}$$ real matrix. The split feasibility problem is to find $${u \in \Omega}$$ with $${Au \in C.}$$ Many problems arising in the image reconstruction can be formulated in this form. In this paper, we propose a descent-projection method for solving the split feasibility problems. The method generates the new iterate by searching the optimal step size along the descent direction. 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. Copyright Springer Science+Business Media, LLC. 2012

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://hdl.handle.net/10.1007/s10898-011-9782-2

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Bibliographic Info

Article provided by Springer in its journal Journal of Global Optimization.

Volume (Year): 54 (2012)
Issue (Month): 3 (November)
Pages: 627-639

as in new window
Handle: RePEc:spr:jglopt:v:54:y:2012:i:3:p:627-639

Contact details of provider:

Order Information:

Related research

Keywords: Variational inequalities; Split feasibility problems; Convergence; Iterative methods; 90C33; 49J40;

Find related papers by JEL classification:

• 90C - - - - - -
• 49J - - - - - -

References

No references listed on IDEAS
You can help add them by filling out this form.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Corrections

When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:54:y:2012:i:3:p:627-639. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.