Table of Contents Author Guidelines Submit a Manuscript
Advances in Operations Research
Volume 2012 (2012), Article ID 483479, 17 pages
http://dx.doi.org/10.1155/2012/483479
Research Article

Modified Halfspace-Relaxation Projection Methods for Solving the Split Feasibility Problem

School of Economics and Management, Southeast University, Nanjing 210096, China

Received 24 March 2012; Accepted 11 May 2012

Academic Editor: Abdellah Bnouhachem

Copyright © 2012 Min Li. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Y. Censor and T. Elfving, “A multiprojection algorithm using Bregman projections in a product space,” Numerical Algorithms, vol. 8, no. 2–4, pp. 221–239, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. B. Qu and N. Xiu, “A new halfspace-relaxation projection method for the split feasibility problem,” Linear Algebra and its Applications, vol. 428, no. 5-6, pp. 1218–1229, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. M. Fukushima, “A relaxed projection method for variational inequalities,” Mathematical Programming, vol. 35, no. 1, pp. 58–70, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  4. B. Qu and N. Xiu, “A note on the CQ algorithm for the split feasibility problem,” Inverse Problems, vol. 21, no. 5, pp. 1655–1665, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. Q. Yang, “The relaxed CQ algorithm solving the split feasibility problem,” Inverse Problems, vol. 20, no. 4, pp. 1261–1266, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. P. Tseng, “A modified forward-backward splitting method for maximal monotone mappings,” SIAM Journal on Control and Optimization, vol. 38, no. 2, pp. 431–446, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. E. N. Khobotov, “A modification of the extragradient method for solving variational inequalities and some optimization problems,” USSR Computational Mathematics and Mathematical Physics, vol. 27, no. 10, pp. 120–127, 1987. View at Google Scholar
  8. G. M. Korpelevič, “An extragradient method for finding saddle points and for other problems,” Èkonomika i Matematicheskie Metody, vol. 12, no. 4, pp. 747–756, 1976. View at Google Scholar
  9. B. He, X. Yuan, and J. J. Z. Zhang, “Comparison of two kinds of prediction-correction methods for monotone variational inequalities,” Computational Optimization and Applications, vol. 27, no. 3, pp. 247–267, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. B. C. Eaves, “On the basic theorem of complementarity,” Mathematical Programming, vol. 1, no. 1, pp. 68–75, 1971. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, USA, 1970.
  12. B. T. Polyak, “Minimization of unsmooth functionals,” USSR Computational Mathematics and Mathematical Physics, vol. 9, pp. 14–29, 1969. View at Google Scholar
  13. Y. Censor, T. Elfving, N. Kopf, and T. Bortfeld, “The multiple-sets split feasibility problem and its applications for inverse problems,” Inverse Problems, vol. 21, no. 6, pp. 2071–2084, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. H.-K. Xu, “A variable Krasnosel'skii-Mann algorithm and the multiple-set split feasibility problem,” Inverse Problems, vol. 22, no. 6, pp. 2021–2034, 2006. View at Publisher · View at Google Scholar
  15. W. Zhang, D. Han, and Z. Li, “A self-adaptive projection method for solving the multiple-sets split feasibility problem,” Inverse Problems, vol. 25, no. 11, pp. 115001–115016, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH