Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping (Q1016416)

From MaRDI portal
Revision as of 12:38, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
scientific article

    Statements

    Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping (English)
    0 references
    5 May 2009
    0 references
    The author considers the problem of minimizing a continuously differentiable strongly convex function over the set of fixed points of a non-expansive mapping in a Hilbert space and proposes a two-step iterative procedure to find its solution. On the one hand, this procedure extends the known conjugate gradient and heavy ball type schemes. On the other hand, it extends the so-called hybrid gradient methods. The strong convergence to a solution is established.
    0 references
    strong convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers