论文信息 - Several solution methods for the split feasibility problem

Several solution methods for the split feasibility problem

Let C and Q be nonempty, closed convex sets in Rn and Rm respectively, and A be an m ? n real matrix. The split feasibility problem (SFP) is to find x C with Ax Q, if such points exist. Byrne proposed the following CQ algorithm to solve the SFP: where ? (0, 2/?(ATA)) with ?(ATA) the spectral radius of the matrix ATA and PC and PQ denote the orthogonal projections onto C and Q, respectively. However, in some cases, it is difficult or even impossible to compute PC and PQ exactly. In this paper, based on the CQ algorithm, we present several algorithms to solve the SFP. Compared with the CQ algorithm, our algorithms are more practical and easier to implement. They can be regarded as improvements of the CQ algorithm.

Qingzhi Yang | Qingzhi Yang | Jinling Zhao | Jinling Zhao

[1] Bingsheng He,et al. Inexact implicit methods for monotone general variational inequalities , 1999, Math. Program..

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

[3] Yair Censor,et al. Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces , 2003, J. Approx. Theory.

[4] Roger J.-B. Wets,et al. ISOMETRIES FOR THE LEGENDRE-FENCHEL TRANSFORM , 1986 .

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

[6] Marc Teboulle,et al. A Logarithmic-Quadratic Proximal Method for Variational Inequalities , 1999, Comput. Optim. Appl..

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

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

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

[10] R. Fletcher. Practical Methods of Optimization , 1988 .