Abstract

We propose the split common fixed point problem that requires to find a common fixed point of a family of operators in one space whose image under a linear transformation is a common fixed point of another family of operators in the image space. We formulate and analyze a parallel algorithm for solving this split common fixed point problem for the class of directed operators and note how it unifies and generalizes previously discussed problems and algorithms

Author information

Contact details are reproduced from the original publication and may be historical.

Yair Censor

Dept. of Mathematics, University of Haifa, Mt. Carmel, Haifa 31905, Israel

yair@math.haifa.ac.il

References

  1. R. Aharoni, A. Berman, Y. Censor: An interior points algorithm for the convex feasibility problem, Adv. Appl. Math. 4 (1983) 479–489.https://doi.org/10.1016/0196-8858(83)90019-2Google Scholar
  2. H. H. Bauschke, J. M. Borwein: On projection algorithms for solving convex feasibility problems, SIAM Rev. 38 (1996) 367–426.https://doi.org/10.1137/S0036144593251710Google Scholar
  3. H. H. Bauschke, P. L. Combettes: A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces, Math. Oper. Res. 26 (2001) 248–264.https://doi.org/10.1287/moor.26.2.248.10558Google Scholar
  4. L. M. Bregman, Y. Censor, S. Reich, Y. Zepkowitz-Malachi: Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces, J. Approximation Theory 124 (2003) 194–218.https://doi.org/10.1016/j.jat.2003.08.004Google Scholar
  5. C. Byrne: Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization, in: Inherently Parallel Algorithms in Feasibility and Optimization and their Applications (Haifa, 2000), D. Butnariu, Y. Censor, S. Reich (eds.), Elsevier, Amsterdam (2001) 87–99.https://doi.org/10.1016/S1570-579X(01)80008-2Google Scholar
  6. C. Byrne: Iterative oblique projection onto convex sets and the split feasability problem, Inverse Probl. 18 (2002) 441–453.https://doi.org/10.1088/0266-5611/18/2/310Google Scholar
  7. C. Byrne: A unified treatment of some iterative algorithms in signal processing and image reconstruction, Inverse Probl. 20 (2004) 103–120.https://doi.org/10.1088/0266-5611/20/1/006Google Scholar
  8. C. L. Byrne: Applied Iterative Methods, A. K. Peters, Wellesley, MA, USA (2008).https://doi.org/10.1201/9780429295492Google Scholar
  9. Y. Censor, T. Bortfeld, B. Martin, A. Trofimov: A unified approach for inversion problems in intensity-modulated radiation therapy, Phys. Med. Biol. 51 (2006) 2353–2365.https://doi.org/10.1088/0031-9155/51/10/001Google Scholar
  10. Y. Censor, T. Elfving: A multiprojection algorithm using Bregman projections in a product space, Numer. Algorithms 8 (1994) 221–239.https://doi.org/10.1007/BF02142692Google Scholar
  11. Y. Censor, T. Elfving, N. Kopf, T. Bortfeld: The multiple-sets split feasibility problem and its applications for inverse problems, Inverse Probl. 21 (2005) 2071–2084.https://doi.org/10.1088/0266-5611/21/6/017Google Scholar
  12. Y. Censor, A. Motova, A. Segal: Perturbed projections and subgradient projections for the multiple-sets split feasibility problem, J. Math. Anal. Appl. 327 (2007) 1244–1256.https://doi.org/10.1016/j.jmaa.2006.05.010Google Scholar
  13. Y. Censor, A. Segal: On the string averaging method for sparse common fixed point problems, Int. Trans. Oper. Res. 16 (2009) 481–494.https://doi.org/10.1111/j.1475-3995.2008.00684.xGoogle Scholar
  14. Y. Censor, S. A. Zenios: Parallel Optimization: Theory, Algorithms, and Applications, Oxford University Press, New York, NY, USA (1997).Google Scholar
  15. P. L. Combettes: Quasi-Fejérian analysis of some optimization algorithms, in: Inherently Parallel Algorithms in Feasibility and Optimization and their Applications (Haifa, 2000), D. Butnariu, Y. Censor, S. Reich (eds.), Elsevier, Amsterdam (2001) 115–152.https://doi.org/10.1016/S1570-579X(01)80010-0Google Scholar
  16. G. Crombez: A geometrical look at iterative methods for operators with fixed points, Numer. Funct. Anal. Optimization 26 (2005) 157–175.https://doi.org/10.1081/NFA-200063882Google Scholar
  17. K. Goebel, S. Reich: Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings, Marcel Dekker, New York (1984).Google Scholar
  18. E. Masad, S. Reich: A note on the multiple-set split convex feasibility problem in Hilbert space, J. Nonlinear Convex Anal. 8 (2007) 367–371.Google Scholar
  19. G. Pierra: Decomposition through formalization in a product space, Math. Program. 28 (1984) 96–115.https://doi.org/10.1007/BF02612715Google Scholar
  20. Q. Yang: The relaxed CQ algorithm solving the split feasibility problem, Inverse Probl. 20 (2004) 1261–1266.https://doi.org/10.1088/0266-5611/20/4/014Google Scholar
  21. M. Zaknoon: Algorithmic Developments for the Convex Feasibility Problem, Ph.D. Thesis, University of Haifa, Haifa (2003).Google Scholar
  22. J. Zhao, Q. Yang: Several solution methods for the split feasibility problem, Inverse Probl. 21 (2005) 1791–1799.https://doi.org/10.1088/0266-5611/21/5/017Google Scholar

Suggested citation

Y. Censor, A. Segal. “The Split Common Fixed Point Problem for Directed Operators.” Journal of Convex Analysis 16 (2009), No. 2, 587–600. https://doi.org/10.68381/jca16031

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 2009. Rights now held by Banach Press LLC.