Annals of Functional Analysis

On solving proximal split feasibility problems and applications

Uamporn Witthayarat, Yeol Je Cho, and Prasit Cholamjiak

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


We study the problem of proximal split feasibility of two objective convex functions in Hilbert spaces. We prove that, under suitable conditions, certain strong convergence theorems of the Halpern-type algorithm present solutions to the proximal split feasibility problem. Finally, we provide some related applications as well as numerical experiments.

Article information

Ann. Funct. Anal., Volume 9, Number 1 (2018), 111-122.

Received: 14 November 2016
Accepted: 28 February 2017
First available in Project Euclid: 14 August 2017

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 47H09: Contraction-type mappings, nonexpansive mappings, A-proper mappings, etc.
Secondary: 47H05: Monotone operators and generalizations 47J25: Iterative procedures [See also 65J15]

split feasibility problem strong convergence Halpern-type algorithm proximity operator


Witthayarat, Uamporn; Cho, Yeol Je; Cholamjiak, Prasit. On solving proximal split feasibility problems and applications. Ann. Funct. Anal. 9 (2018), no. 1, 111--122. doi:10.1215/20088752-2017-0028.

Export citation


  • [1] C. Byrne, Iterative oblique projection onto convex sets and the split feasibility problem, Inverse Problems 18 (2002), no. 2, 441–453.
  • [2] C. Byrne, Y. Censor, A. Gibali, and S. Reich, The split common null point problem, J. Nonlinear Convex Anal. 13 (2012), no. 4, 759–775.
  • [3] Y. Censor, T. Bortfeld, B. Martin, and A. Trofimov, A unified approach for inversion problems in intensity-modulated radiation therapy, Phys. Med. Biol. 51 (2006) 2353–2365.
  • [4] Y. Censor and T. Elfving, A multiprojection algorithm using Bregman projections in a product space, Numer. Algorithms 8 (1994), no. 2–4, 221–239.
  • [5] P. L. Combettes and V. R. Wajs, Signal recovery by proximal forward-backward splitting, Multiscale Model. Simul. 4 (2005), no. 4, 1168–1200.
  • [6] A. Gibali and A. Moudafi, From implicit convex feasibility to convex minimization, Trans. Math. Program Appl. 5 (2017), 25–45.
  • [7] K. Goebel and W. A. Kirk, Topics on Metric Fixed Point Theory, Cambridge Univ. Press, Cambridge, 1990.
  • [8] S. He and C. Yang, Solving the variational inequality problem defined on intersection of finite level sets, Abstr. Appl. Anal. 2013 (2013), art. ID 942315.
  • [9] G. López, V. Martín-Márquez, F. Wang, and H. K. Xu, Solving the split feasibility problem without prior knowledge of matrix norms, Inverse Problems 28 (2012), no. 8, art. ID 085004.
  • [10] A. Moudafi, Split monotone variational inclusions, J. Optim. Theory Appl. 150 (2011), no. 2, 275–283.
  • [11] A. Moudafi and B. S. Thakur, Solving proximal split feasibility problems without prior knowledge of operator norms, Optim. Lett. 8 (2014), no. 7, 2099–2110.
  • [12] H. K. Xu, Iterative methods for the split feasibility problem in infinite dimensional Hilbert spaces, Inverse Problems 26 (2010), art. ID 105018.
  • [13] J. Zhao and Q. Yang, Several solution methods for the split feasibility problem, Inverse Problems 21 (2005), no. 5, 1791–1799.