Results 11 to 20 of about 28,200 (255)
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
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
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
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
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
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
On Two Projection Algorithms for the Multiple-Sets Split Feasibility Problem [PDF]
Journal of Applied Mathematics, 2013 We present a projection algorithm which modifies the method proposed by Censor and Elfving (1994) and also introduce a self-adaptive algorithm for the multiple-sets split feasibility problem (MSFP).
Qiao-Li Dong, Songnian He
doaj +4 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
Douglas–Rachford Splitting Method with Linearization for the Split Feasibility Problem [PDF]
Symmetry, 2022 The aim of this article is to introduce the Douglas–Rachford splitting method with linearization to solve the split feasibility problem (SFP). Our proposed method includes two existing methods in work of Tang et al. and Wang as special cases. The ranges of the parameters in work of Tang et al. are extended from (0,1) to (0,2). Under standard conditions,
Ziyue Hu +3 more
openaire +1 more source
l 1-l 2 regularization of split feasibility problems [PDF]
Numerical Algorithms, 2017 arXiv admin note: text overlap with arXiv:1609.09530 by other ...
Abdellatif Moudafi, Aviv Gibali
openaire +4 more sources