[HTML][HTML] Strong convergence of a relaxed CQ algorithm for the split feasibility problem
S He, Z Zhao - Journal of Inequalities and Applications, 2013 - Springer
The split feasibility problem (SFP) is finding a point in a given closed convex subset of a
Hilbert space such that its image under a bounded linear operator belongs to a given closed …
Hilbert space such that its image under a bounded linear operator belongs to a given closed …
“Optimal” choice of the step length of the projection and contraction methods for solving the split feasibility problem
In this paper, first, we review the projection and contraction methods for solving the split
feasibility problem (SFP), and then by using the inverse strongly monotone property of the …
feasibility problem (SFP), and then by using the inverse strongly monotone property of the …
Solving the split feasibility problem without prior knowledge of matrix norms
The split feasibility problem (SFP) consists in finding a point in a given closed convex subset
of a Hilbert space such that its image under a bounded linear operator belongs to a given …
of a Hilbert space such that its image under a bounded linear operator belongs to a given …
The ball-relaxed CQ algorithms for the split feasibility problem
H Yu, W Zhan, F Wang - Optimization, 2018 - Taylor & Francis
The split feasibility problem (SFP) is to find so that, where C and Q are non-empty closed
convex subsets in Hilbert spaces and, respectively, and A is a linear bounded operator from …
convex subsets in Hilbert spaces and, respectively, and A is a linear bounded operator from …
A family of projection gradient methods for solving the multiple-sets split feasibility problem
J Wang, Y Hu, CKW Yu, X Zhuang - Journal of Optimization Theory and …, 2019 - Springer
In the present paper, we explore a family of projection gradient methods for solving the
multiple-sets split feasibility problem, which include the cyclic/simultaneous iteration …
multiple-sets split feasibility problem, which include the cyclic/simultaneous iteration …
[PDF][PDF] Hybrid extragradient methods for finding minimum-norm solutions of split feasibility problems
In this paper, we consider the split feasibility problem (SFP) on a nonempty closed convex
subset C of a Hilbert space of arbitrary dimension. When C is given as the common fixed …
subset C of a Hilbert space of arbitrary dimension. When C is given as the common fixed …
An iterative algorithm for solving split equilibrium problems and split equality variational inclusions for a class of nonexpansive-type maps
CE Chidume, OM Romanus, UV Nnyaba - Optimization, 2018 - Taylor & Francis
In this paper, an iterative algorithm that approximates solutions of split equality fixed point
problems (SEFPP) for quasi-φ-nonexpansive maps is constructed. Strong convergence of …
problems (SEFPP) for quasi-φ-nonexpansive maps is constructed. Strong convergence of …
Remark on the successive projection algorithm for the multiple-sets split feasibility problem
B Qu, H Chang - Numerical Functional Analysis and Optimization, 2017 - Taylor & Francis
Recently, assuming that the metric projection onto a closed convex set is easily calculated,
Liu et al.(Numer. Func. Anal. Opt. 35: 1459–1466, 2014) presented a successive projection …
Liu et al.(Numer. Func. Anal. Opt. 35: 1459–1466, 2014) presented a successive projection …
A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
S He, Z Zhao, B Luo - Optimization, 2015 - Taylor & Francis
The multiple-sets split feasibility problem (MSFP) is to find a point belongs to the intersection
of a family of closed convex sets in one space, such that its image under a linear …
of a family of closed convex sets in one space, such that its image under a linear …