Auxiliary principle and algorithm for mixed equilibrium problems and bilevel mixed equilibrium problems in Banach spaces (Q604255)

From MaRDI portal





scientific article; zbMATH DE number 5814299
Language Label Description Also known as
default for all languages
No label defined
    English
    Auxiliary principle and algorithm for mixed equilibrium problems and bilevel mixed equilibrium problems in Banach spaces
    scientific article; zbMATH DE number 5814299

      Statements

      Auxiliary principle and algorithm for mixed equilibrium problems and bilevel mixed equilibrium problems in Banach spaces (English)
      0 references
      10 November 2010
      0 references
      Let \(B\) be a Banach space with dual \(B^*\). Let \(\|\cdot\|\) be the norm of \(B\) and \(\langle\cdot,\cdot\rangle\) the duality pairing between \(B\) and \(B^*\). Let \(C\) be a nomempty closed convex subset of \(B\). Let \(F,H: C\times C\to\mathbb{R}\) and \(\psi,\phi: B\times B\to\mathbb{R}\) be four bifunctions. It is considered the following bilevel mixed equilibrium problem: \[ \text{find }\overline x\in S_{F,\phi}\text{ such that }H(\overline x,y)+ \psi(y,\overline x)- \psi(\overline x,\overline x)\geq 0,\;\forall y\in S_{F,\phi}, \] where \(S_{F,\phi}\) is the solution set of the following mixed equilibrium problem: \[ \text{find }u\in C\text{ such that }F(u,y)+ \phi(y, u)- \phi(u, u)\geq 0,\;\forall y\in C. \] By using the auxiliary principle technique, new iterative algorithms for solving the mixed equilibrium problems and bilevel mixed equilibrium problems are suggested and analyzed. Strong convergence of the iterative sequences generated by the algorithms is proved under suitable conditions. The behavior of the solution set of the bilevel mixed equilibrium problem is also discussed.
      0 references
      mixed equilibrium problems
      0 references
      bilevel mixed equilibrium problems
      0 references
      monotonicity
      0 references
      auxiliary principle
      0 references
      Banach spaces
      0 references
      0 references
      0 references
      0 references

      Identifiers