Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지
DOI QR코드

DOI QR Code

A STRONGLY CONVERGENT PARALLEL PROJECTION ALGORITHM FOR CONVEX FEASIBILITY PROBLEM

  • Dang, Ya-Zheng (School of Management, University of Shanghai for Science and Technology) ;
  • Gao, Yan (School of Management, University of Shanghai for Science and Technology)
  • Received : 2011.04.05
  • Accepted : 2011.07.02
  • Published : 2012.01.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we present a strongly convergent parallel projection algorithm by introducing some parameter sequences for convex feasibility problem. To prove the strong convergence in a simple way, we transmit the parallel algorithm in the original space to an alternating one in a newly constructed product space. Thus, the strong convergence of the parallel projection algorithm is derived with the help of the alternating one under some parametric controlling conditions.

Keywords

References

  1. S. Boyd, L. E. Ghaoui, etal, Linear matrix inequalities in system and control theory, SIAM, Philadlphia, 1994.
  2. D. Butnariu, Y. Censor, etal,On the behavior of subgradient projections methods for convex feasibility problems in Euclidean spaces, SIAM J. Optim. Vol. 19 (2008), 786-807. https://doi.org/10.1137/070689127
  3. D.Batnariu and Y. Censor, Strong convergence of almost simultaneous block-iterative projections methods in Hilbert spaces, J. Comput. Appl. Math. Vol. 53 (1994), 33-42. https://doi.org/10.1016/0377-0427(92)00123-Q
  4. H. H.Bauschke and J. M. Borwein,On projection algorithms for solving convex feasibility problems, SIAM. Rev., Vol. 38(1996), 367-426. https://doi.org/10.1137/S0036144593251710
  5. Y. Censor and A. Lent,Cyclic subgradient projections, Math. Program. Vol. 24 (1982), 233-235. https://doi.org/10.1007/BF01585107
  6. Y. Censor and A. Segal, On the string averaging method for sparse common fixed points problems, International Transactions in Operational Research, Vol. 16 (2009), 481-494. https://doi.org/10.1111/j.1475-3995.2008.00684.x
  7. Y. Censor, D. Gordon and R. Gordon,BICAV: A block-iterative, parallel algorithm for sparse systems with pixel-dependent weighting, IEEE T. Med. Imaging. Vol. 10 (2001), 1050-1060.
  8. Y. Censor and S. A. Zenios, Parallel Optimization: Theorey, Algorithms and Applications, Oxford University Press, Oxford,1997.
  9. P. L. Combettes,Convex set theoretic image reconvery by extrapolated iterations of parallel subgradient projections, IEEE T. Imag. Process. 1997, Vol. 6, 1-21.
  10. P. L. Combettes,Inconsistent signal feasibility problems: Least-Sequares solutions in a product space, IEEE T. Imag. Process. Vol. 10 (1994), 2955-2966.
  11. G. Crombez,Non-monotoneous parallel iteration for solving convex geasibility problems, Kybernetika, Vol. 5 (2003), 547-560.
  12. G. Crombez,A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets, Czech. Math. J. Vol. 56 (2006), 491-506. https://doi.org/10.1007/s10587-006-0031-7
  13. G. Crombez,Weak and norm convergence of a parallel projection method in Hilbert space, Appl.Math. and Comput. Vol. 56 (1993), 35-48.
  14. F. Deutsch,The method of alternating orthogonal projections, Approximation Theory, Spline Functions and Applications, Kluwer Academic Publishers, Dordrecht, 1992.
  15. F. Deutsch, Best approximation in inner product space, Springer-Verlag, New York, 2001.
  16. R. Davidi. G. T. Herman, and Y. Censor, Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections, International Transactions in Operational Research, Vol. 16 (2009), 505-524. https://doi.org/10.1111/j.1475-3995.2009.00695.x
  17. Y. Gao, Determining the viability for an affine nonlinear control system(in Chinese), J of Control and Appl. Vol. 26 (2009), 654-656.
  18. K. C. Kiwiel,Block-iterative surrogate projection methods for convex feasibility problem, Linear Algebra Appl. Vol.215 (1995),225-260 https://doi.org/10.1016/0024-3795(93)00089-I
  19. L. Li and Y. Gao, Projection algorithm with line search for solving the convex feasibility problem, Journal of Information and Computing Science, Vol. 3 (2008), 62-68.
  20. L. Li and Y. Gao,Approximate subgradient projection algorithm for a convex feasibility problem, J. Syst. Eng. Electron. Vol.21 (2010), 527-530. https://doi.org/10.3969/j.issn.1004-4132.2010.03.027
  21. P. L. Lions, Approximation de points fixes de contractions, C. R. Acad. Sci. Paris, Vol. 21 (1997),1357-1359.
  22. L. D. Marks, W. Sinkler and E. Landree, A feasible set approach to the crystallographic phase problem, Acta Crystallogr. Vol. 55 (1999), 601-612.
  23. S. N. Penfold, R. W. Schulte, Y. Censor, etal, Block-iterative and string-averaging projection algorithms in proton computed tomography image reconstruction, Biomedical Mathematics: Promising Directions in Imaging, Therapy Planning and Inverse Problems, Madis-onMedical Physics Publishing, 2010: 347-367.
  24. A. R. De Pierro and A. N. Iusem, A parallel projection method of finding a common point of a family of convex sets, Pesquisa Operacional, Vol. 5 (1985), 1-20.
  25. G. Pierra, Decomposition through formalization in a product space, Math. Prog. Vol. 28(1984), 96-115. https://doi.org/10.1007/BF02612715
  26. T. Suzuki, Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces, Fixed Point Theory A. Vol. 1 (2005), 103-123.
  27. Z. F. Tan and X. Li,The multi-level optimization models for a large-scale compound system and its decomposition-coordination solving algorithm, International Journal of Pure and Applied Mathematics, Vol. 28 (2006), 407-416.
  28. H. K. Xu, Viscosity approximation methods for nonexpansive mappings, J. Math. Anal. Appl. Vol. 298 (2004), 279-291. https://doi.org/10.1016/j.jmaa.2004.04.059