Optimization for Inconsistent Split Feasibility Problems

• Published in: Numerical functional analysis and optimization Vol. 37; no. 2; pp. 186 - 205
• Main Author: Iiduka, Hideaki
• Format: Journal Article
• Language: English
• Published: Taylor & Francis 01.02.2016
• Subjects: Convex optimization; Feasibility; fixed point; inconsistent split feasibility problem; Iterative algorithms; Linear operators; Mathematical models; Minimization; nonexpansive mapping; Optimization; Subsidiaries; three-term conjugate gradient method
• ISSN: 0163-0563; 1532-2467
• DOI: 10.1080/01630563.2015.1080270

The split feasibility problem deals with finding a point in a closed convex subset of the domain space of a linear operator such that the image of the point under the linear operator is in a prescribed closed convex subset of the image space. The split feasibility problem and its variants and generalizations have been widely investigated as a means for resolving practical inverse problems in various disciplines. Many iterative algorithms have been proposed for solving the problem. This article discusses a split feasibility problem which does not have a solution, referred to as an inconsistent split feasibility problem. When the closed convex set of the domain space is the absolute set and the closed convex set of the image space is the subsidiary set, it would be reasonable to formulate a compromise solution of the inconsistent split feasibility problem by using a point in the absolute set such that its image of the linear operator is closest to the subsidiary set in terms of the norm. We show that the problem of finding the compromise solution can be expressed as a convex minimization problem over the fixed point set of a nonexpansive mapping and propose an iterative algorithm, with three-term conjugate gradient directions, for solving the minimization problem.