Applications of Fixed-Point and Optimization Methods to the Multiple-Set Split Feasibility Problem

Yonghong Yao, Rudong Chen, Giuseppe Marino and Yeong Cheng Liou

Journal of Applied Mathematics, 2012, vol. 2012, 1-21

Abstract:

The multiple-set split feasibility problem requires finding a point closest to a family of closed convex sets in one space such that its image under a linear transformation will be closest to another family of closed convex sets in the image space. It can be a model for many inverse problems where constraints are imposed on the solutions in the domain of a linear operator as well as in the operator’s range. It generalizes the convex feasibility problem as well as the two-set split feasibility problem. In this paper, we will review and report some recent results on iterative approaches to the multiple-set split feasibility problem.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2012/927530.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2012/927530.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:jnljam:927530

DOI: 10.1155/2012/927530

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().