Algorithms for approximating minimization problems in Hilbert spaces (Q534233)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5895479
Language Label Description Also known as
default for all languages
No label defined
    English
    Algorithms for approximating minimization problems in Hilbert spaces
    scientific article; zbMATH DE number 5895479

      Statements

      Algorithms for approximating minimization problems in Hilbert spaces (English)
      0 references
      0 references
      0 references
      0 references
      17 May 2011
      0 references
      The authors investigate the following optimization problem in a real Hilbert space: \[ \mu/2\langle Bx,x\rangle+ 1/2\| x\|^2- h(x)\to \min,\quad\text{subject to }x\in\text{Fix}(S)\cap\Omega, \] where \(B\) is a bounded linear operator, \(\mu\geq 0\), \(h\) is a potential function, \(\text{Fix}(S)\) is the set of fixed points of the nonexpansive mapping \(S\), and \(\Omega\) is a solution set of an equilibrium problem. An explicit and an implicit iterative algorithm for solving this problem are proposed.
      0 references
      nonexpansive mapping
      0 references
      monotone mapping
      0 references
      fixed point
      0 references
      equilibrium problem
      0 references
      variational inequality
      0 references
      minimization problem
      0 references
      Hilbert space
      0 references
      iterative algorithms
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references