[PDF] Top 20 An improved method for solving multiple-sets split feasibility problem
Has 10000 "An improved method for solving multiple-sets split feasibility problem" found on our website. Below are the top 20 most common "An improved method for solving multiple-sets split feasibility problem".
An improved method for solving multiple-sets split feasibility problem
... The multiple-sets split feasibility problem (MSSFP) is a gen- eralization of the split feasibility problem (SFP) and the convex feasibility problem ... See full document
12
Weak convergence theorems for split feasibility problems on zeros of the sum of monotone operators and fixed point sets in Hilbert spaces
... This problem was introduced by Martinet [], and later it has been studied by many ...iteration method that was used for solving the problem ... See full document
17
Iterative algorithm for solving the multiple sets split equality problem with split self adaptive step size in Hilbert spaces
... The split equality problem is a generalization of the split feasibility problem, meanwhile it is a special case of multiple-sets split equality ...for ... See full document
9
Strong convergence of a self-adaptive method for the split feasibility problem
... convex feasibility problem (CFP), which is to find a point in the nonempty intersection of finitely many closed and convex sets, we next briefly review some historic approaches which relate to the ... See full document
12
An algorithm for the split feasibility problems with application to the split equality problem
... the multiple-sets split-feasibility problem that requires one to find a point closest to a family of closed convex sets in one space such that its image under a linear ... See full document
12
Preconditioning methods for solving a general split feasibility problem
... be improved []. In [, ], a preconditioning method is applied to modify the projected Landweber algorithm for solving a linear feasibility problem ... See full document
11
Simultaneous iterative algorithms for the split common fixed-point problem of generalized asymptotically quasi-nonexpansive mappings without prior knowledge of operator norms
... for solving SCFP ...helpful method for estimating the stepsizes which do not need prior knowledge of the operator norms for solving the split feasibility problems and ... See full document
12
Strong convergence of an extragradient type algorithm for the multiple sets split equality problem
... this method was applied for finding a common element of the set of solutions for a variational inequality and the set of fixed points of a nonexpansive mapping, see Nadezhkina et ...extragradient method, and ... See full document
11
A preconditioning method of the CQ algorithm for solving an extended split feasibility problem
... convex sets, and A is an M by N matrix. This problem plays an important role in the study of signal processing, image reconstruction, and so on [, ...a method called the CQ algorithm for ... See full document
11
Alternating proximal penalization algorithm for the modified multiple sets split feasibility problems
... modified multiple-sets feasibility problem. For this method, we first show that the sequences generated by the algorithm are summable, which guarantees that the distance between two ... See full document
8
Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size
... the multiple-sets split feasibility problem, which was motivated by the in- verse problem of intensity modulated radiation therapy ...The multiple-sets split ... See full document
15
Iterative process for solving a multiple set split feasibility problem
... The multiple-set split feasibility problem (MSSFP) is to find a point contained in the in- tersection of a family of closed convex sets in one space such that its image under a linear ... See full document
10
The constrained multiple sets split feasibility problem and its projection algorithms
... for solving the constrained multiple-sets split feasibility problem are ...constrained multiple-sets split feasibility problem can be ... See full document
10
Gradient projection method with a new step size for the split feasibility problem
... projection method with a new step size, which is not depend on the related matrix inverses and the largest eigen- value (or the spectral radius of the self-adjoint operator) of the related matrix, based on ... See full document
22
Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis
... The split feasibility problem has received much attention due to its applications in signal processing and image reconstruction [] with particular progress in intensity modulated therapy ...the ... See full document
13
Multiple set split feasibility problems for κ asymptotically strictly pseudo nonspreading mappings in Hilbert spaces
... The purpose of this article is under suitable conditions to prove some weak and strong convergence theorems for solving multiple-set split feasibility problem (.) for a κ ... See full document
14
Some Krasnonsel'skiĭ-Mann Algorithms and the Multiple-Set Split Feasibility Problem
... Remark 3.4. The algorithms 3.12, 3.13, and 3.15 of Xu 13 are some projection algorithms for solving the MSSEP 1.10, which are concrete projection algorithms. In this paper, firstly, we present some general ... See full document
12
Strong convergence theorems for the split variational inclusion problem in Hilbert spaces
... the split feasibility problem in finite dimensional Hilbert spaces was first intro- duced by Censor and Elfving [] for modeling inverse problems which arise from medical image ...the split ... See full document
20
Strong convergence theorems for the general split variational inclusion problem in Hilbert spaces
... a split feasibility problem and a split optimization problem and give some strong con- vergence theorems for these problems in Hilbert ... See full document
14
Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
... When C and Q are level sets, the projections in Algorithm 3.2 might be hard to be im- plemented (see [1, 8, 9, 13, 25, 26]). To overcome this difficulty, we propose a relaxed al- ternating CQ-algorithm, which is ... See full document
18
Related subjects