[PDF] Top 20 Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
Has 10000 "Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces" found on our website. Below are the top 20 most common "Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces".
Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
... the relaxed projection algorithm, we propose two new relaxed alternating algorithms for the SEP governed by level sets, which present an affirmative answer to Moudafi’s ...the split ... See full document
18
General split equality problems in Hilbert spaces
... feasibility problem, the split equality problem (SEP), has been proposed by Moudafi and ...in Hilbert spaces and we established the strong convergence of a proposed algorithm to a ... See full document
8
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 ...multiple-sets ... See full document
9
Linear convergence of the relaxed gradient projection algorithm for solving the split equality problems in Hilbert spaces
... the relaxed gradient projection algorithm to solve the split equality problem in Hilbert spaces, and we investigate its linear ...the split equality problem ... See full document
12
Strong and weak convergence theorems for split equality generalized mixed equilibrium problem
... consider split equality generalized mixed equilibrium problem, which is more general than many problems such as split feasibility problem, split equality problem, ... See full document
19
Strong convergence of an extragradient type algorithm for the multiple sets split equality problem
... Motivated and inspired by the above works, we introduce an extragradient-type method to solve the MSSEP in this paper. Under some suitable conditions, the strong convergence of an algorithm can be verified in the ... See full document
11
An algorithm for the split feasibility problems with application to the split equality problem
... the split-feasibility problem in Hilbert spaces by using the projected reflected gradient ...inverse problem and the split-equality problem in Hilbert ... See full document
12
Split equality problem and multiple sets split equality problem for quasi nonexpansive multi valued mappings
... infinite-dimensional Hilbert spaces, and propose an algorithm to solve the SEP and MSSEP not requiring to compute the projection on the closed convex ... See full document
8
Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
... the problem in signal and image processing, but also it is strongly related to some general problems, such as the convex feasibility problem [], the multiple-set split feasibility problem ... See full document
14
Strong convergence theorems for the split equality variational inclusion problem and fixed point problem in Hilbert spaces
... on Hilbert space H), the problem () is equivalent to the well-known split feasibility problem ...The split equality problems allow asymmetric and partial relations between the ... See full document
18
Moudafi’s open question and simultaneous iterative algorithm for general split equality variational inclusion problems and general split equality optimization problems
... general split feasibility problem, general split equality problem, and split variational inclusion problem in real Hilbert ...on split feasibility problems ... See full document
17
Simultaneous and semi alternating projection algorithms for solving split equality problems
... It is clear [27, Theorem 3] that a monotone mapping A is maximal if and only if, for any (x, u) ∈ H × H, if u – v, x – y ≥ 0 for all (v, y) ∈ G(A), then it follows that u ∈ A(x). Lemma 2.3 ([26]) Let D be a nonempty, ... See full document
28
An alternating iteration algorithm for solving the split equality fixed point problem with L Lipschitz and quasi pseudo contractive mappings
... real Hilbert spaces, f : X → R ∪ {+∞}, g : Y → R ∪ {+∞} are closed con- vex proper functions acting, respectively, on the spaces X and Y, Q : X × Y → R + is a nonnegative quadratic form which couples ... See full document
13
Strong convergence of a relaxed CQ algorithm for the split feasibility problem
... 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 convex subset of ... See full document
11
Alternating mann iterative algorithms for the split common fixed-point problem of quasi-nonexpansive mappings
... (Alternating CQ-algorithms for convex feasibility and split fixed-point problems, ...an alternating CQ-algorithm with weak convergence for the following split common ... See full document
12
Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
... the split feasibility problem SFP [] has been attracting re- searchers’ interest [, ] due to its extensive applications in signal processing and image re- construction [], with particular progress in ... See full document
22
Hybrid simultaneous algorithms for the split equality problem with applications
... most algorithms for the split equality problems came from the idea of the projected Landweber algorithm proposed by Byrne and Moudafi (Working paper UAG, 2013), and few algorithms came from the ... See full document
17
Iterative methods for the split common fixed point problem in Hilbert spaces
... There has been growing interest in recent years in the split feasibility problem (SFP) []. The SFP is very useful in dealing with problems in signal processing and image recon- struction [], especially in ... See full document
8
Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
... The above equivalence relation (.) reminds us to use fixed point method to solve (.). Many authors have given a continuation of the study on the CQ algorithm and its variant form. For related work, please refer ... See full document
14
Approximating Curve and Strong Convergence of the CQ Algorithm for the Split Feasibility Problem
... It is therefore the aim of this paper to construct a new algorithm so that strong convergence is guaranteed. The paper is organized as follows. In the next section, some useful lemmas are given. In Section 3, we define ... See full document
13
Related subjects