Strong convergence theorem of two-step iterative algorithm for split feasibility problems. (English) Zbl 1332.90204
Summary: The main purpose of this paper is to introduce a two-step iterative algorithm for split feasibility problems such that the strong convergence is guaranteed. Our result extends and improves the corresponding results of He et al. and some others.
MSC:
| 90C25 | Convex programming |
| 90C30 | Nonlinear programming |
| 47J25 | Iterative procedures involving nonlinear operators |
Keywords:
split feasibility problem; two-step iterative algorithm; strong convergence; bounded linear operatorReferences:
| [1] | Censor Y, Elfving T: A multiprojection algorithm using Bregman projection in product space.Numer. Algorithms 1994, 8:221-239. · Zbl 0828.65065 · doi:10.1007/BF02142692 |
| [2] | Aleyner A, Reich S: Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach.J. Math. Anal. Appl. 2008,343(1):427-435. · Zbl 1167.90010 · doi:10.1016/j.jmaa.2008.01.087 |
| [3] | Bauschke HH, Borwein JM: On projection algorithms for solving convex feasibility problems.SIAM Rev. 1996,38(3):367-426. · Zbl 0865.47039 · doi:10.1137/S0036144593251710 |
| [4] | Moudafi A: A relaxed alternating CQ-algorithm for convex feasibility problems.Nonlinear Anal. 2013, 79:117-121. · Zbl 1256.49044 · doi:10.1016/j.na.2012.11.013 |
| [5] | Masad E, Reich S: A note on the multiple-set split convex feasibility problem in Hilbert space.J. Nonlinear Convex Anal. 2007, 8:367-371. · Zbl 1171.90009 |
| [6] | Yao, Y.; Chen, R.; Marino, G.; Liou, YC, Applications of fixed point and optimization methods to the multiple-sets split feasibility problem, No. 2012 (2012) |
| [7] | Xu HK: A variable Krasnosel’skii-Mann algorithm and the multiple-set split feasibility problem.Inverse Probl. 2006, 22:2021-2034. · Zbl 1126.47057 · doi:10.1088/0266-5611/22/6/007 |
| [8] | Xu HK: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces.Inverse Probl. 2010.,26(10): Article ID 105018 · Zbl 1213.65085 |
| [9] | Yang Q: The relaxed CQ algorithm for solving the split feasibility problem.Inverse Probl. 2004, 20:1261-1266. · Zbl 1066.65047 · doi:10.1088/0266-5611/20/4/014 |
| [10] | Zhao J, Yang Q: Several solution methods for the split feasibility problem.Inverse Probl. 2005, 21:1791-1799. · Zbl 1080.65035 · doi:10.1088/0266-5611/21/5/017 |
| [11] | Byrne C: Iterative oblique projection onto convex sets and the split feasibility problem.Inverse Probl. 2002, 18:441-453. · Zbl 0996.65048 · doi:10.1088/0266-5611/18/2/310 |
| [12] | López, G.; Martín-Márquez, V.; Wang, FH; Xu, HK, Solving the split feasibility problem without prior knowledge of matrix norms (2012) · Zbl 1262.90193 |
| [13] | Yang Q: On variable-set relaxed projection algorithm for variational inequalities.J. Math. Anal. Appl. 2005, 302:166-179. · Zbl 1056.49018 · doi:10.1016/j.jmaa.2004.07.048 |
| [14] | Fukushima M: A relaxed projection method for variational inequalities.Math. Program. 1986, 35:58-70. · Zbl 0598.49024 · doi:10.1007/BF01589441 |
| [15] | He, S.; Zhao, Z., Strong convergence of a relaxed CQ algorithm for the split feasibility problem, No. 2013 (2013) · Zbl 1282.90125 |
| [16] | Xu HK: Iterative algorithms for nonlinear operators.J. Lond. Math. Soc. 2002, 66:240-256. · Zbl 1013.47032 · doi:10.1112/S0024610702003332 |
| [17] | Chang SS: On Chidume’s open questions and approximate solutions for multi-valued strongly accretive mapping equations in Banach spaces.J. Math. Anal. Appl. 1997, 216:94-111. · Zbl 0909.47049 · doi:10.1006/jmaa.1997.5661 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
