Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings (Q312192)

From MaRDI portal
Revision as of 23:58, 4 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings
scientific article

    Statements

    Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings (English)
    0 references
    0 references
    0 references
    0 references
    14 September 2016
    0 references
    Three modified (hybrid) extragradient algorithms are proposed with convergence proofs for simultaneously solving a huge number of equilibrium problems and fixed point equations with nonexpansive operators in a given real Hilbert space. In the theory, the first two extragradient steps are replaced by the corresponding convex minimization problems which allows them to use more general assumptions (pseudomonotone bifunction). However, this can reduce the efficiency of the algorithms if the closed convex set \(C\) is very general. The given numeric example has \(2\times 10^6\) equilibrium problems over the real axis and \(3 \times 10^6\) fixed point equations also over the real axis. The very simple convex set is \(C=[0,1]\) and because of the simplicity of the example the extragradient steps can be explicitly executed. Hence the example is not representative for the used generality in the theory.
    0 references
    equilibrium problem
    0 references
    pseudomonotone bifunction
    0 references
    Lipschitz-type continuity
    0 references
    nonexpansive mapping
    0 references
    hybrid method
    0 references
    parallel computation
    0 references
    extragradient method
    0 references
    simultaneous solution of huge systems
    0 references
    fixed point equations
    0 references
    Hilbert space
    0 references
    convex minimization
    0 references
    algorithm
    0 references
    numerical example
    0 references

    Identifiers

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