The split equilibrium problem and its convergence algorithms (Q379090): Difference between revisions
From MaRDI portal
Latest revision as of 00:13, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The split equilibrium problem and its convergence algorithms |
scientific article |
Statements
The split equilibrium problem and its convergence algorithms (English)
0 references
8 November 2013
0 references
Let \(E_1\) and \(E_2\) be two real Banach spaces. Let \(C\) be a closed convex subset of \(E_1\), \(K\) a closed convex subset of \(E_2\), \(A: E_1 \to E_2\) be a bounded linear operator, and \(f: C \times C \to\mathbb R\) and \(g: K \times K \to\mathbb R\) be two bi-functions. The split equilibrium problem is to find an element \(p\in C\) such that \(f(p,y) \geq 0\) for all \(y \in C\) and such that \(u=Ap \in K\) solves the variational inequality \(g(u,v) \geq 0\) for all \(v \in K\). The author proposes an iterative method for solving the problem in the case of Hilbert spaces \(E_1,E_2\).
0 references
iterative algorithm
0 references
split equilibrium problem
0 references
strong convergence
0 references
weak convergence
0 references