General Method for Solving the Split Common Fixed Point Problem

详细信息    查看全文

• 作者：Andrzej Cegielski (1)
  
  1. Faculty of Mathematics ; Computer Science and Econometrics ; University of Zielona G贸ra ; ul. Szafrana 4a ; 65-516 ; Zielona Gora ; Poland
  
• 关键词：Split feasibility problem ; Split common fixed point problem ; Quasi ; nonexpansive operators ; Block ; iterative procedure ; Demi ; closedness principle ; 47J25 ; 47N10 ; 65J15 ; 90C25
• 刊名：Journal of Optimization Theory and Applications
• 出版年：2015
• 出版时间：May 2015
• 年：2015
• 卷：165
• 期：2
• 页码：385-404
• 全文大小：250 KB
• 参考文献：1. Censor, Y, Elfving, T (1994) A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 8: pp. 221-239 CrossRef
  2. Byrne, C (2002) Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 18: pp. 441-453 CrossRef
  3. Qu, B, Xiu, N (2005) A note on the CQ algorithm for the split feasibility problem. Inverse Probl. 21: pp. 1655-1665 CrossRef
  4. Qu, B, Xiu, N (2008) A new halfspace-relaxation projection method for the split feasibility problem. Lin. Algebra Appl. 428: pp. 1218-1229 CrossRef
  5. Xu, H.-K.: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Probl. 26, 105018 (2010). 17 pp
  6. Moudafi, A.: The split common fixed-point problem for demicontractive mappings. Inverse Probl. 26, 055007 (2010). 6 pp
  7. Moudafi, A (2011) A note on the split common fixed-point problem for quasi-nonexpansive operators. Nonlinear Anal. 74: pp. 4083-4087 CrossRef
  8. Censor, Y, Segal, A (2009) The split common fixed point problem for directed operators. J. Convex Anal. 16: pp. 587-600
  9. Censor, Y, Elfving, T, Kopf, N, Bortfeld, T (2005) The multiple-sets split feasibility problem and its applications for inverse problems. Inverse Probl. 21: pp. 2071-2084 CrossRef
  10. Censor, Y, Motova, A, Segal, A (2007) Perturbed projections and subgradient projections for the multiple-sets split feasibility problem. J. Math. Anal. Appl. 327: pp. 1244-1256 CrossRef
  11. Masad, E, Reich, S (2007) A note on the multiple-set split convex feasibility problem in Hilbert space. J. Nonlinear Convex Anal. 8: pp. 367-372
  12. Xu, H-K (2006) A variable Krasnosel鈥檚ki沫-Mann algorithm and the multiple-set split feasibility problem. Inverse Probl. 22: pp. 2021-2034 CrossRef
  13. Wang, F., Xu, H.-K.: Cyclic algorithms for split feasibility problems in Hilbert spaces. Nonlinear Anal. 74, 4105鈥?111 (2011)
  14. Cegielski, A.: Iterative Methods for Fixed Point Problems in Hilbert Spaces. Lecture Notes in Mathematics, vol. 2057. Springer, Heidelberg (2012)
  15. Bauschke, HH, Combettes, PL (2001) A weak-to-strong convergence principle for Fej茅r-monotone methods in Hilbert spaces. Math. Oper. Res. 26: pp. 248-264 CrossRef
  16. Yamada, I, Ogura, N (2004) Hybrid steepest descent method for variational inequality problem over the fixed point set of certain quasi-nonexpansive mapping. Numer. Funct. Anal. Optimiz. 25: pp. 619-655 CrossRef
  17. Cegielski, A (2010) Generalized relaxations of nonexpansive operators and convex feasibility problems. Contemp. Math. 513: pp. 111-123 CrossRef
  18. Cegielski, A., Censor, Y.: Opial-type theorems and the common fixed point problem. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering. Springer Optimization and Its Applications, vol. 49, pp. 155鈥?83. New York, NY, USA (2011)
  19. Opial, Z (1967) Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 73: pp. 591-597 CrossRef
  20. Cegielski, A (2007) A generalization of the Opial鈥檚 theorem. Control Cybern. 36: pp. 601-610
  21. Yang, Q (2004) The relaxed CQ algorithm solving the split feasibility problem. Inverse Probl. 20: pp. 1261-1266 CrossRef
  22. Cegielski, A (2007) Convergence of the projected surrogate constraints method for the linear split feasibility problems. J. Convex Anal. 14: pp. 169-183
  23. Zhao, J, Yang, Q (2005) Several solution methods for the split feasibility problem. Inverse Probl. 21: pp. 1791-1799 CrossRef
  24. Cegielski, A., Zalas, R.: Properties of a class of approximately shrinking operators and their applications. Fixed Point Theory. 15, 399鈥?26 (2014)
  25. Bauschke, HH, Borwein, J (1996) On projection algorithms for solving convex feasibility problems. SIAM Rev. 38: pp. 367-426 CrossRef
  
• 刊物主题：Calculus of Variations and Optimal Control; Optimization; Optimization; Theory of Computation; Applications of Mathematics; Engineering, general; Operations Research/Decision Theory;
• 出版者：Springer US
• ISSN：1573-2878

文摘

The split common fixed point problem (also called the multiple-sets split feasibility problem) is to find a common fixed point of a finite family of operators in one real Hilbert space, whose image under a bounded linear transformation is a common fixed point of another family of operators in the image space. In the literature one can find many methods for solving this problem as well as for its special case, called the split feasibility problem. We propose a general method for solving both problems. The method is based on a block-iterative procedure, in which we apply quasi-nonexpansive operators satisfying the demi-closedness principle and having a common fixed point. We prove the weak convergence of sequences generated by this method and show that the convergence for methods known from the literature follows from our general result.