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

Abstract

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.

Citation

Download Citation

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

Information

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

zbMATH: 06841345
MathSciNet: MR3758747
Digital Object Identifier: 10.1215/20088752-2017-0028

Subjects:
Primary: 47H09
Secondary: 47H05 , 47J25

Keywords: Halpern-type algorithm , proximity operator , split feasibility problem , strong convergence

Rights: Copyright © 2018 Tusi Mathematical Research Group

JOURNAL ARTICLE
12 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.9 • No. 1 • February 2018
Back to Top