Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces

2010 ◽  
Vol 26 (10) ◽  
pp. 105018 ◽  
Author(s):  
Hong-Kun Xu
Keyword(s):  
Iterative Methods ◽  
Hilbert Spaces ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Infinite Dimensional ◽  
The Split Feasibility Problem ◽  
Split Feasibility

scholarly journals A Strongly Convergent Method for the Split Feasibility Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-15 ◽  
Author(s):  
Yonghong Yao ◽  
Yeong-Cheng Liou ◽  
Naseer Shahzad
Keyword(s):  
Hilbert Spaces ◽  
Extragradient Method ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Infinite Dimensional ◽  
Convergence Point ◽  
Convergent Method ◽  
The Split Feasibility Problem ◽  
Split Feasibility ◽  
Regularized Method

The purpose of this paper is to introduce and analyze a strongly convergent method which combined regularized method, with extragradient method for solving the split feasibility problem in the setting of infinite-dimensional Hilbert spaces. Note that the strong convergence point is the minimum norm solution of the split feasibility problem.

scholarly journals A Modified Halpern's Iterative Scheme for Solving Split Feasibility Problems

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Jitsupa Deepho ◽  
Poom Kumam
Keyword(s):  
Hilbert Space ◽  
Hilbert Spaces ◽  
Iterative Scheme ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Infinite Dimensional ◽  
Infinite Dimensional Hilbert Space ◽  
The Split Feasibility Problem ◽  
Split Feasibility

The purpose of this paper is to introduce and study a modified Halpern’s iterative scheme for solving the split feasibility problem (SFP) in the setting of infinite-dimensional Hilbert spaces. Under suitable conditions a strong convergence theorem is established. The main result presented in this paper improves and extends some recent results done by Xu (Iterative methods for the split feasibility problem in infinite-dimensional Hilbert space, Inverse Problem 26 (2010) 105018) and some others.

scholarly journals A New Extragradient-Type Algorithm for the Split Feasibility Problem

2016 ◽  
Vol 2016 ◽  
pp. 1-8
Author(s):  
Yazheng Dang ◽  
Yan Gao ◽  
Bo Wang
Keyword(s):  
Hilbert Spaces ◽  
Extragradient Method ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Subgradient Extragradient Method ◽  
Type Method ◽  
Infinite Dimensional ◽  
Type Algorithm ◽  
The Split Feasibility Problem ◽  
Split Feasibility

We consider the split feasibility problem (SFP) in Hilbert spaces, inspired by extragradient method presented by Ceng, Ansari for split feasibility problem, subgradient extragradient method proposed by Censor, and variant extragradient-type method presented by Yao for variational inequalities; we suggest an extragradient-type algorithm for the SFP. We prove the strong convergence under some suitable conditions in infinite-dimensional Hilbert spaces.

scholarly journals New Inertial Relaxed CQ Algorithms for Solving Split Feasibility Problems in Hilbert Spaces

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Haiying Li ◽  
Yulian Wu ◽  
Fenghui Wang
Keyword(s):  
Hilbert Spaces ◽  
Split Feasibility Problem ◽  
Linear Operators ◽  
Feasibility Problem ◽  
Variable Step Size ◽  
Step Size ◽  
Bounded Linear ◽  
Variable Step ◽  
The Split Feasibility Problem ◽  
Split Feasibility

The split feasibility problem SFP has received much attention due to its various applications in signal processing and image reconstruction. In this paper, we propose two inertial relaxed C Q algorithms for solving the split feasibility problem in real Hilbert spaces according to the previous experience of applying inertial technology to the algorithm. These algorithms involve metric projections onto half-spaces, and we construct new variable step size, which has an exact form and does not need to know a prior information norm of bounded linear operators. Furthermore, we also establish weak and strong convergence of the proposed algorithms under certain mild conditions and present a numerical experiment to illustrate the performance of the proposed algorithms.

scholarly journals A general convergence theorem for multiple-set split feasibility problem in Hilbert spaces

2015 ◽  
Vol 31 (3) ◽  
pp. 349-357
Author(s):  
ABDUL RAHIM KHAN ◽  
◽  
MUJAHID ABBAS ◽  
YEKINI SHEHU ◽  
◽  
...  
Keyword(s):  
Strong Convergence ◽  
Hilbert Spaces ◽  
Convergence Theorem ◽  
Split Feasibility Problem ◽  
Contractive Mapping ◽  
Convergence Result ◽  
Feasibility Problem ◽  
Infinite Dimensional ◽  
Split Feasibility ◽  
General Convergence

We establish strong convergence result of split feasibility problem for a family of quasi-nonexpansive multi-valued mappings and a total asymptotically strict pseudo-contractive mapping in infinite dimensional Hilbert spaces.

Subgradient algorithm for split hierarchical optimization problems

2018 ◽  
Vol 34 (3) ◽  
pp. 391-399
Author(s):  
NIMIT NIMANA ◽  
◽  
NARIN PETROT ◽  
◽  
Keyword(s):  
Hilbert Spaces ◽  
Optimization Problems ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Hierarchical Optimization ◽  
Convergence Results ◽  
Hierarchical Optimization Problems ◽  
Subgradient Algorithm ◽  
The Split Feasibility Problem ◽  
Split Feasibility

In this paper we emphasize a split type problem of some integrating ideas of the split feasibility problem and the hierarchical optimization problem. Working on real Hilbert spaces, we propose a subgradient algorithm for approximating a solution of the introduced problem. We discuss its convergence results and present a numerical example.

scholarly journals An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality Problem

2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Luoyi Shi ◽  
Ru Dong Chen ◽  
Yu Jing Wu
Keyword(s):  
Iterative Algorithm ◽  
Hilbert Spaces ◽  
Split Feasibility Problem ◽  
Linear Operators ◽  
Feasibility Problem ◽  
Bounded Linear ◽  
Split Equality Problem ◽  
Infinite Dimensional ◽  
Equality Problem ◽  
Split Feasibility

The multiple-sets split equality problem (MSSEP) requires finding a pointx∈∩i=1NCi,y∈∩j=1MQjsuch thatAx=By, whereNandMare positive integers,{C1,C2,…,CN}and{Q1,Q2,…,QM}are closed convex subsets of Hilbert spacesH1,H2, respectively, andA:H1→H3,B:H2→H3are two bounded linear operators. WhenN=M=1, the MSSEP is called the split equality problem (SEP). If  B=I, then the MSSEP and SEP reduce to the well-known multiple-sets split feasibility problem (MSSFP) and split feasibility problem (SFP), respectively. One of the purposes of this paper is to introduce an iterative algorithm to solve the SEP and MSSEP in the framework of infinite-dimensional Hilbert spaces under some more mild conditions for the iterative coefficient.

Sign in / Sign up

Export Citation Format

Share Document