Composite algorithms for minimization over the solutions of equilibrium problems and fixed point problems (Q610880): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080307102 / rank
 
Normal rank

Revision as of 22:29, 19 March 2024

scientific article
Language Label Description Also known as
English
Composite algorithms for minimization over the solutions of equilibrium problems and fixed point problems
scientific article

    Statements

    Composite algorithms for minimization over the solutions of equilibrium problems and fixed point problems (English)
    0 references
    0 references
    0 references
    13 December 2010
    0 references
    Summary: The purpose of this paper is to solve the minimization problem of finding \(x^*\) such that \(x^*=\arg \min_{x\in \Gamma }\| x\|^2\), where \(\Gamma \) stands for the intersection set of the solution set of the equilibrium problem and the fixed points set of a nonexpansive mapping. We first present two new composite algorithms (one implicit and one explicit). Further, we prove that the proposed composite algorithms converge strongly to \(x^*\).
    0 references
    minimization problem
    0 references
    composite algorithms
    0 references

    Identifiers