The Mann-type extragradient iterative algorithms with regularization for solving variational inequality problems, split feasibility, and fixed point problems (Q369899)

From MaRDI portal
Revision as of 21:59, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Mann-type extragradient iterative algorithms with regularization for solving variational inequality problems, split feasibility, and fixed point problems
scientific article

    Statements

    The Mann-type extragradient iterative algorithms with regularization for solving variational inequality problems, split feasibility, and fixed point problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 September 2013
    0 references
    Summary: The purpose of this paper is to introduce and analyze the Mann-type extragradient iterative algorithms with regularization for finding a common element of the solution set \(\Xi\) of a general system of variational inequalities, the solution set \(\Gamma\) of a split feasibility problem, and the fixed point set \(\text{Fix}(S)\) of a strictly pseudocontractive mapping \(S\) in the setting of Hilbert spaces. These iterative algorithms are based on the regularization method, the Mann-type iteration method, and the extragradient method due to \textit{N. Nadezhkina} and \textit{W. Takahashi} [J. Optim. Theory Appl. 128, No. 1, 191--201 (2006; Zbl 1130.90055)]. Furthermore, we prove that the sequences generated by the proposed algorithms converge weakly to an element of \(\text{Fix}(S) \cap \Xi \cap \Gamma\) under mild conditions.
    0 references
    0 references
    weak convergence
    0 references
    Mann-type extragradient iterative algorithms with regularization
    0 references
    split feasibility problem
    0 references
    strictly pseudocontractive mapping
    0 references
    Hilbert spaces
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references