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

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.

[1]  B. G. Fallone,et al.  Intensity-Modulated Radiation Therapy: The State of the Art , 2004 .

[2]  A. Goldstein.  Convex programming in Hilbert space , 1964 .

[3]  Y. Censor,et al.  BICAV: a block-iterative parallel algorithm for sparse systems with pixel-related weighting , 2001, IEEE Transactions on Medical Imaging.

[4]  Bertolt Eicke.  Iteration methods for convexly constrained ill-posed problems in hilbert space , 1992 .

[5]  Qingzhi Yang.  The relaxed CQ algorithm solving the split feasibility problem , 2004 .

[6]  Yair Censor,et al.  The Split Common Fixed Point Problem for Directed Operators. , 2010, Journal of convex analysis.

[7]  N. Xiu,et al.  A note on the CQ algorithm for the split feasibility problem , 2005 .

[8]  C. Byrne,et al.  A unified treatment of some iterative algorithms in signal processing and image reconstruction , 2003 .

[9]  Simeon Reich,et al.  On the unrestricted iteration of projections in Hilbert space , 1991 .

[10]  R. Mohan,et al.  Optimization of intensity-modulated radiotherapy plans based on the equivalent uniform dose. , 2002, International journal of radiation oncology, biology, physics.

[11]  Fenghui Wang,et al.  Approximating Curve and Strong Convergence of the CQ Algorithm for the Split Feasibility Problem , 2010 .

[12]  Yair Censor.  Mathematical Aspects of Radiation Therapy Treatment Planning: Continuous Inversion Versus Full Discretization and Optimization Versus Feasibility , 1999 .

[13]  Masao Fukushima,et al.  A relaxed projection method for variational inequalities , 1986, Math. Program..

[14]  Sabine Schenk,et al.  1 Concepts and Methodology , 2013 .

[15]  Eva K. Lee,et al.  Integer Programming Applied to Intensity-Modulated Radiation Therapy Treatment Planning , 2003, Ann. Oper. Res..

[16]  Hong-Kun Xu,et al.  Averaged Mappings and the Gradient-Projection Algorithm , 2011, J. Optim. Theory Appl..

[17]  Qingzhi Yang,et al.  Several solution methods for the split feasibility problem , 2005 .

[18]  Richard J. Mammone,et al.  Image recovery by convex projections using a least-squares constraint , 1990 .

[19]  Qingzhi Yang,et al.  The relaxed inexact projection methods for the split feasibility problem , 2011, Appl. Math. Comput..

[20]  Abdellatif Moudafi,et al.  The split common fixed-point problem for demicontractive mappings , 2010 .

[21]  Heinz H. Bauschke,et al.  On Projection Algorithms for Solving Convex Feasibility Problems , 1996, SIAM Rev..

[22]  Y. Censor,et al.  Perturbed projections and subgradient projections for the multiple-sets split feasibility problem , 2007 .

[23]  C. Byrne,et al.  Iterative oblique projection onto convex sets and the split feasibility problem , 2002 .

[24]  E. Polak,et al.  Constrained Minimization Problems in Finite-Dimensional Spaces , 1966 .

[25]  Y. Censor,et al.  The multiple-sets split feasibility problem and its applications for inverse problems , 2005 .

[26]  Hong-Kun Xu.  A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem , 2006 .

[27]  Yair Censor,et al.  BICAV: An Inherently Parallel Algorithm for Sparse Systems with Pixel-Dependent Weighting , 2001, IEEE Trans. Medical Imaging.

[28]  C. Byrne.  Bregman-Legendre Multidistance Projection Algorithms for Convex Feasibility and Optimization , 2001 .

[29]  Hong-Kun Xu,et al.  Cyclic algorithms for split feasibility problems in Hilbert spaces , 2011 .

[30]  Han,et al.  A New Modified Goldstein-Levitin-Polyak Project ion Method for Variational Inequality Problems , 2004 .

[31]  Dante C. Youla,et al.  On deterministic convergence of iterations of relaxed projection operators , 1990, J. Vis. Commun. Image Represent..

[32]  Hong-Kun Xu.  Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces , 2010 .

[33]  Yair Censor,et al.  Proximity Function Minimization Using Multiple Bregman Projections, with Applications to Split Feasibility and Kullback–Leibler Distance Minimization , 2001, Ann. Oper. Res..

[34]  Qingzhi Yang,et al.  Self-adaptive projection methods for the multiple-sets split feasibility problem , 2011 .

[35]  Y. Censor,et al.  A unified approach for inversion problems in intensity-modulated radiation therapy , 2006, Physics in medicine and biology.

[36]  Y. Censor,et al.  A computational solution of the inverse problem in radiation-therapy treatment planning , 1988 .

[37]  Qingzhi Yang,et al.  Generalized KM theorems and their applications , 2006 .

[38]  Yan Gao,et al.  The strong convergence of a KM–CQ-like algorithm for a split feasibility problem , 2010 .

[39]  Yair Censor,et al.  A multiprojection algorithm using Bregman projections in a product space , 1994, Numerical Algorithms.

[40]  Boris Polyak,et al.  Constrained minimization methods , 1966 .

[41]  Deren Han,et al.  A self-adaptive projection method for solving the multiple-sets split feasibility problem , 2009 .

[42]  Wenyu Sun,et al.  A new modified Goldstein-Levitin-Polyakprojection method for variational inequality problems , 2004 .

[43]  Yair Censor,et al.  The Subgradient Extragradient Method for Solving Variational Inequalities in Hilbert Space , 2011, J. Optim. Theory Appl..

[44]  Hai Yang,et al.  Modified Goldstein–Levitin–Polyak Projection Method for Asymmetric Strongly Monotone Variational Inequalities , 2002 .