Results 1 to 10 of about 304,321 (280)
Regularized Methods for the Split Feasibility Problem [PDF]
Abstract and Applied Analysis, 2012 Many applied problems such as image reconstructions and signal processing can be formulated as the split feasibility problem (SFP). Some algorithms have been introduced in the literature for solving the (SFP).
Yonghong Yao +2 more
doaj +3 more sources
An algorithm for the split-feasibility problems with application to the split-equality problem [PDF]
Journal of Inequalities and Applications, 2017 In this paper, we study the split-feasibility problem in Hilbert spaces by using the projected reflected gradient algorithm. As applications, we study the convex linear inverse problem and the split-equality problem in Hilbert spaces, and we give new ...
Chih-Sheng Chuang, Chi-Ming Chen
doaj +4 more sources
Relaxed Extragradient Algorithms for the Split Feasibility Problem [PDF]
Journal of Applied Mathematics, 2014 The purpose of this paper is to introduce a new relaxed extragradient algorithms for the split feasibility problem. Our relaxed extragradient algorithm is new and it generalized some results for solving the split feasibility problem.
Youli Yu, Shin Min Kang, Young Chel Kwun
doaj +3 more sources
General Split Feasibility Problems in Hilbert Spaces [PDF]
Abstract and Applied Analysis, 2013 Introducing a general split feasibility problem in the setting of infinite-dimensional Hilbert spaces, we prove that the sequence generated by the purposed new algorithm converges strongly to a solution of the general split feasibility problem.
Mohammad Eslamian, Abdul Latif
doaj +3 more sources
A Regularized Algorithm for the Proximal Split Feasibility Problem [PDF]
Abstract and Applied Analysis, 2014 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.
Zhangsong Yao +3 more
doaj +3 more sources
The Ball-Relaxed Gradient-Projection Algorithm for Split Feasibility Problem
Journal of Function Spaces, 2022 In this paper, we concern with the split feasibility problem (SFP) whenever the convex sets involved are composed of level sets. By applying Gradient-projection algorithm which is used to solve constrained convex minimization problem of a real valued ...
Xiaochun Li, Xiaoxiao Liu, Fugen Gao
doaj +2 more sources
An Extrapolated Iterative Algorithm for Multiple-Set Split Feasibility Problem [PDF]
Abstract and Applied Analysis, 2012 The multiple-set split feasibility problem (MSSFP), as a generalization of the split feasibility problem, is to find a point in the intersection of a family of closed convex sets in one space such that its image under a linear transformation will be in ...
Yazheng Dang, Yan Gao
doaj +3 more sources
A Strongly Convergent Method for the Split Feasibility Problem [PDF]
Abstract and Applied Analysis, 2012 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
Yonghong Yao +2 more
doaj +4 more sources
A Modified Halpern's Iterative Scheme for Solving Split Feasibility Problems [PDF]
Abstract and Applied Analysis, 2012 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.
Jitsupa Deepho, Poom Kumam
doaj +3 more sources
The split feasibility problem with polynomials [PDF]
SCIENTIA SINICA Mathematica, 2020 This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations for representing the intersection of the sets. Properties of the semidefinite relaxations are studied. Based on that,
Nie, Jiawang, Zhao, Jinling
openaire +2 more sources