Bregman distance and strong convergence of proximal-type algorithms (Q2318864)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Bregman distance and strong convergence of proximal-type algorithms
scientific article

    Statements

    Bregman distance and strong convergence of proximal-type algorithms (English)
    0 references
    0 references
    0 references
    16 August 2019
    0 references
    Summary: The purpose of this paper is to discuss some fundamental properties of Bregman distance, generalized projection operators, firmly nonexpansive mappings, and resolvent operators of set-valued monotone operators corresponding to a functional \(\Phi(\Vert \cdot \Vert)\). We further study some proximal point algorithms for finding zeros of monotone operators and solving generalized mixed equilibrium problems in Banach spaces. Our results improve and extend some recent results concerning generalized projection operators corresponding to Bregman distance.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers