## Taiwanese Journal of Mathematics

### ON AN OPEN QUESTION OF MOUDAFI FOR CONVEX FEASIBILITY PROBLEMS IN HILBERT SPACES

Eskandar Naraghirad

#### Abstract

Very recently, Moudafi (Nonlinear Analysis 79 (2013) 117-121) introduced a relaxed alternating CQ-algorithm (RACQA) with weak convergence for the following convex feasibility problem: $$\mbox{Find}~x\in C,~y\in Q\hspace{0.4cm}\mbox{such that}~Ax=By, \tag{1.1}$$ where $H_1,~H_2,~H_3$ are real Hilbert spaces, $C\subset H_1$, $Q\subset H_2$ are two nonempty, closed and convex level sets, and $A:H_1\to H_3$, $B:H_2\to H_3$ are two bounded linear operators. In this paper, we will continue to consider the problem (1.1) and obtain a strongly convergent iterative sequence of Halpern-type to a solution of the problem and provide an affirmative answer to an open question posed by Moudafi in his recent work for convex feasibility problems in real Hilbert spaces. Furthermore, we study Halpern-type iterative schemes for finding common solutions of a convex feasibility problem and common fixed points of an infinite family of quasi-nonexpansive mappings in Hilbert spaces. Our results improve and generalize many known results in the current literature.

#### Article information

Source
Taiwanese J. Math., Volume 18, Number 2 (2014), 371-408.

Dates
First available in Project Euclid: 10 July 2017

Permanent link to this document
https://projecteuclid.org/euclid.twjm/1499706392

Digital Object Identifier
doi:10.11650/tjm.18.2014.3463

Mathematical Reviews number (MathSciNet)
MR3188509

Zentralblatt MATH identifier
1357.47074

#### Citation

Naraghirad, Eskandar. ON AN OPEN QUESTION OF MOUDAFI FOR CONVEX FEASIBILITY PROBLEMS IN HILBERT SPACES. Taiwanese J. Math. 18 (2014), no. 2, 371--408. doi:10.11650/tjm.18.2014.3463. https://projecteuclid.org/euclid.twjm/1499706392

#### References

• A. Aleyner and S. Reich, Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach, Journal of Mathematical Analysis and Applications, 343(1) (2008), 427-435.
• H. Attouch, J. Bolte, P. Redont and A. Soubeyran, Alternating proximal algorithms for weakly coupled minimization problems, Applications to dynamical games and PDEs, Journal of Convex Analysis, 15 (2008), 485-506.
• H. H. Bauschke and J. M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Review, 38(3) (1996), 367-426.
• H. H. Bauschke and P. L. Combettes, A weak-to-strong convergence principle for Fejr-monotone methods in Hilbert spaces, Math. Oper. Res., 26(2) (2001), 248-264.
• Ch. Byrne, Iterative oblique projection onto convex sets and the split feasibility problem, Inverse Problems, 18 (2002), 441-453.
• C. Byrne, A Unified Treatment of Some Iterative Algorithms in Signal Processing and Image Reconstruction, Marcel Dekker, New York, 1984.
• L. C. Ceng, Q. H. Ansari and J. C. Yao, Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem, Nonlinear Analysis, 75 (2012), 2116-2125.
• L. C. Ceng, Q. H. Ansari and J. C. Yao, An extragradient method for solving split feasibility and fixed point problems, Computers and Mathematics with Applications, 64 (2012), 633-642.
• L. C. Ceng, Q. H. Ansari and C. F. Wen, Implicit relaxed and hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappins in the intermediate sense, Abstract and Applied Analysis, 2013 (2013), Article ID 854297, 14 pp.
• L. C. Ceng, Q. H. Ansari and J. C. Yao, Mann type iterative methods for finding a common solution of split feasibility and fixed point problems, Positivity, 16 (2012), 471-495.
• L. C. Ceng, H. Gupta and C. F. Wen, The Mann-type extragradient iterative algorithms with regularization for solving variational inequality problems, split feasibility, and fixed point problems, Abstract and Applied Analysis, 2013 (2013), Article ID 378750, pp. 19
• L. C. Ceng, Q. H. Ansari and J. C. Yao, Extragradient-projection method for solving constrained convex minimization problems, Numerical Algebra, Control and Optimization, 1 (2011), 341-359.
• L. C. Ceng, Q. H. Ansari and J. C. Yao, Some iterative methods for finding fixed points and for solving constrained convex minimization problems, Nonlinear Analysis, 74 (2011), 5286-5302.
• L. C. Ceng, Q. H. Ansari and C. F. Wen, Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems, Journal of Inequalities and Applications, 2013 2013:240, 26 pp. doi:10.1168/1029-242X-2013-240.
• L. C. Ceng, H. K. Xu and C. F. Wen, Relaxed viscosity approximation methods with regularization for constrained minimization problems, Journal of Applied Mathematics, 2013 (2013), Article ID 531859, 19 pp.
• L. C. Ceng, A. Petrusel and J. C. Yao, Relaxed extragradient methods with regularization for general system of variational inequalities with constraints of split feasibility and fixed point problems, Abstract and Applied Analysis, 2013 (2013), Article ID 891232, 25 pp.
• L. C. Ceng and C. F. Wen, Hybrid gradient-projection algorithm for solving constrained convex minimization problems with generalized mixed equilibrium problems, Journal of Function Spaces and Applications, 2012 (2012), Article ID 678353, 26 pp.
• Y. Censor, T. Bortfeld, B. Martin and A. Trofimov, A unified approach for inversion problems in intensity-modulated radiation therapy, Physics in Medicine and Biology, 51 (2006), 2353-2365.
• Y. Censor and T. Elfving, A multiprojection algorithm using Bregman projections in a product space, Numerical Algorithms, 8 (1994), 221-239.
• Y. Censor, T. Elfving, N. Kopf and T. Bortfled, The multi-sets split feasibility problem and it applications to inverse problems, Inverse Problems, 21 (2005), 2071-2084.
• Y. Censor and A. Segal, The split common fixed point problem for directed operators, J. Convex Anal., 16 (2009), 587-600.
• S. S. Chang, J. K. Kim and X. R. Wang, Modified block iterative algorithm for solving convex feasibility problems in Banach spaces, J. Inequal. Appl. V., 2010 (2010), 14 pp., doi:10.1155/2010/86968 (Article ID 869684).
• F. Deutsch, Best Approximation in Inner Product Spaces, Springer-Verlag, New York, 2001.
• K. Geobel and W. A. Kirk, Topics on Metric Fixed Point Theory, in: Cambridge Studies in Advanced Mathematics, Vol. 28, Cambridge University Press, 1990.
• B. Halpern, Fixed points of nonexpanding mappings, Bull. Amer. Math. Soc., 73 (1967), 957-961.
• Z. R. Kong, L. C. Ceng and C. F. Wen, Some modified extragradient methods for solving split feasibility and fixed point problems, Abstract and Applied Analysis, 2012 (2012), Article ID 975981, 32 pp.
• P. E. Maingé, The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces, Comput. Math. Appl., 59(1) (2010), 74-79.
• P. E. Maingé, Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization, Set-Valued Anal., 16 (2008), 899-912.
• S. Maruster and C. Popirlan, On the Mann-type iteration and convex feasibility problem, J. Comput. Appl. Math., 212 (2008), 390-396.
• E. Masad and S. Reich, A note on the multiple-set split convex feasibility problem in Hilbert space, Journal of Nonlinear and Convex Analysis, 8 (2007), 367-371.
• A. Moudafi, A note on the split common fixed-point problems for quasi-nonexpansive operators, Nonlinea Analysis, 74 (2011), 4083-4087.
• Abdellatif Moudafi, A relaxed alternating CQ-algorithm for convex feasibility problems, Nonlinea Analysis, 79 (2013), 117-121.
• Weerayuth Nilsrakoo and Satit Saejung, Strong convegence theorems by Halpern-Mann iterations for relatively nonexpansive mappings in Banach spaces, Applied Mathematics and Computation, 217 (2011), 6577-6586.
• S. Reich, Approximating fixed points of nonexpanding mappings, Panamer Math. J., 4 (1994), 23-28.
• N. Shoiji and W. Takahashi, Strong convergence of approxiamted sequences for nonexpansive mappings in Banach spaces, Proc. Math. Soc., 125 (1997), 3641-3645.
• Y. Song and X. Chai, Halpern iteration for firmly type nonexpansive mappings, Nonlinear Anal., 71 (2009), 4500-4506.
• W. Takahashi, Nonlinear Functional Analysis, Fixed Point Theory and Its Applications, Yokahama Publishers, Yokahama, 2000.
• W. Takahashi and G. E. Kim, Approximating fixed points of nonexpansive mappings in Banach spaces, Math. Japan., 48 (1998), 1-9.
• R. Wittmann, Approximation of fixed points of nonexpansive mappings, Arch. Math., 58 (1992), 486-491.
• H. K. Xu, A variable Krasnose\ptmrs \'lskii-Mann algorithm and the multiple-set split feasibility problem, Inverse Problems, 22 (2006), 2021-2034.
• H. K. Xu and T. K. Kim, Convergence of hybrid steepest-descent methods for variational inequalities, Journal of Optimization Theory and Applications, 119(1) (2003), 185-201.
• I. Yamada, Sinal Processing Applications of a Pair of Simple Fixed Point Algorithms, Approximation and optimization in image restoration and reconstruction, Poquerolles, France, 2009.
• Y. Yao, R. Chen, G. Marino and Y. C. Liou, Applications of fixed point and optimization methods to the multiple-sets split feasibility problem, Journal of Applied Mathematics, 2012 (2012), 21, Article ID 927530.
• J. Zhao and Q. Yang, Several solution methods for the split feasibility problem, Inverse Problems, 21 (2005), 1791-1799.