Abstract and Applied Analysis

A Regularized Algorithm for the Proximal Split Feasibility Problem

Zhangsong Yao, Sun Young Cho, Shin Min Kang, and Li-Jun Zhu

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

The proximal split feasibility problem has been studied. A regularized method has been presented for solving the proximal split feasibility problem. Strong convergence theorem is given.

Article information

Source
Abstr. Appl. Anal., Volume 2014, Special Issue (2014), Article ID 894272, 6 pages.

Dates
First available in Project Euclid: 27 February 2015

Permanent link to this document
https://projecteuclid.org/euclid.aaa/1425048213

Digital Object Identifier
doi:10.1155/2014/894272

Mathematical Reviews number (MathSciNet)
MR3230538

Zentralblatt MATH identifier
07023257

Citation

Yao, Zhangsong; Cho, Sun Young; Kang, Shin Min; Zhu, Li-Jun. A Regularized Algorithm for the Proximal Split Feasibility Problem. Abstr. Appl. Anal. 2014, Special Issue (2014), Article ID 894272, 6 pages. doi:10.1155/2014/894272. https://projecteuclid.org/euclid.aaa/1425048213


Export citation

References

  • 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.
  • C. Byrne, “Iterative oblique projection onto convex sets and the split feasibility problem,” Inverse Problems, vol. 18, no. 2, pp. 441–453, 2002.
  • H.-K. Xu, “Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces,” Inverse Problems, vol. 26, no. 10, Article ID 105018, 17 pages, 2010.
  • C. Byrne, “A unified treatment of some iterative algorithms in signal processing and image reconstruction,” Inverse Problems, vol. 20, no. 1, pp. 103–120, 2004.
  • J. Zhao and Q. Yang, “Several solution methods for the split feasibility problem,” Inverse Problems, vol. 21, no. 5, pp. 1791–1799, 2005.
  • Y. Dang and Y. Gao, “The strong convergence of a KM-CQ-like algorithm for a split feasibility problem,” Inverse Problems, vol. 27, no. 1, Article ID 015007, 9 pages, 2011.
  • F. Wang and H. Xu, “Approximating curve and strong convergence of the $CQ$ algorithm for the split feasibility problem,” Journal of Inequalities and Applications, vol. 2010, Article ID 102085, 13 pages, 2010.
  • Y. Yao, W. Jigang, and Y. Liou, “Regularized methods for the split feasibility problem,” Abstract and Applied Analysis, vol. 2012, Article ID 140679, 13 pages, 2012.
  • A. Moudafi and B. S. Thakur, “Solving proximal split feasibility problems without prior knowledge of operator norms,” Optimization Letters, 2013.
  • H. K. Xu, “Iterative algorithms for nonlinear operators,” Journal of the London Mathematical Society, vol. 66, no. 1, pp. 240–256, 2002.
  • P. E. Maingé, “Strong convergence of projected subgradient methods for non-smooth and non-strictly convex minimization,” Set-Valued Analysis, vol. 16, no. 7-8, pp. 899–912, 2008.
  • A. Moudafi, “Split monotone variational inclusions,” Journal of Optimization Theory and Applications, vol. 150, no. 2, pp. 275–283, 2011.
  • C. Byrne, Y. Censor, A. Gibaliand, and S. Reich, “Weak and strong convergence of algorithms for the split common null point problem,” Journal of Nonlinear and Convex Analysis, vol. 13, pp. 759–775, 2012.
  • Y. Yu, “An explicit method for the split feasibility problem with self-adaptive step sizes,” Abstract and Applied Analysis, vol. 2012, Article ID 432501, 9 pages, 2012. \endinput