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, issue 1

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)
https://doi.org/10.1155/2012/927530

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:wly:jnljam:v:2012:y:2012:i:1:n:927530

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().