2014
DOI: 10.1080/00036811.2013.872777
|View full text |Cite
|
Sign up to set email alerts
|

Parallel methods for regularizing systems of equations involving accretive operators

Abstract: In this paper, two parallel methods for solving systems of accretive operator equations in Banach spaces are studied. The convergence analysis of the methods in both free-noise and noisy data cases is provided.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
8

Relationship

4
4

Authors

Journals

citations
Cited by 26 publications
(13 citation statements)
references
References 19 publications
(14 reference statements)
0
13
0
Order By: Relevance
“…Let us denote the solution set of VIP (2) by V I (A, K ). Problem 1 is a generalization of many other problems including: convex feasibility problems, common fixed point problems, common minimizer problems, common saddle-point problems, hierarchical variational inequality problems, variational inequality problems over the intersection of convex sets, etc., see [3][4][5]7,12,21,22]. In this paper, we focus on projection methods, which together with regularization ones are fundamental methods for solving VIPs with monotone and Lipschitz continuous mappings.…”
Section: Introductionmentioning
confidence: 99%
“…Let us denote the solution set of VIP (2) by V I (A, K ). Problem 1 is a generalization of many other problems including: convex feasibility problems, common fixed point problems, common minimizer problems, common saddle-point problems, hierarchical variational inequality problems, variational inequality problems over the intersection of convex sets, etc., see [3][4][5]7,12,21,22]. In this paper, we focus on projection methods, which together with regularization ones are fundamental methods for solving VIPs with monotone and Lipschitz continuous mappings.…”
Section: Introductionmentioning
confidence: 99%
“…Several sequential and parallel iterative regularization methods [1,2,6,8,10] have been proposed for finding a solution of the system (32). Using Theorem 3.1, we also obtain the following result:…”
Section: Resultsmentioning
confidence: 99%
“…Let C be a nonempty closed convex subset of H. Let A : C → H be a (nonlinear) operator. The variational inequality problem is to find p * ∈ C such that (1) Ap * , p − p * ≥ 0, ∀p ∈ C.…”
Section: Introductionmentioning
confidence: 99%
“…CSEP (1) is very general in the sense that it includes, as special cases, many mathematical models: common solutions to variational inequalities, convex feasibility problems, common fixed point problems, see for instance [2,8,10,11,14,21,34,37]. These problems have been widely studied both theoretically and algorithmically over the past decades due to their applications to other fields [5,10,15,29].…”
Section: Introductionmentioning
confidence: 99%