The Split Feasibility Problem and Its Solution Algorithm

Biao Qu and Binghua Liu

Mathematical Problems in Engineering, 2018, vol. 2018, 1-7

Abstract:

The split feasibility problem arises in many fields in the real world, such as signal processing, image reconstruction, and medical care. In this paper, we present a solution algorithm called memory gradient projection method for solving the split feasibility problem, which employs a parameter and two previous iterations to get the next iteration, and its step size can be calculated directly. It not only improves the flexibility of the algorithm, but also avoids computing the largest eigenvalue of the related matrix or estimating the Lipschitz constant in each iteration. Theoretical convergence results are established under some suitable conditions.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2018/4123168.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2018/4123168.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:4123168

DOI: 10.1155/2018/4123168

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().