A perturbed iterative procedure for multivalued pseudo-contractive mappings and multivalued accretive mappings in Banach spaces (Q1962995): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Nan-Jing Huang / rank
 
Normal rank
Property / author
 
Property / author: Min-Ru Bai / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Christian C. Fenske / rank
 
Normal rank

Revision as of 09:45, 11 February 2024

scientific article
Language Label Description Also known as
English
A perturbed iterative procedure for multivalued pseudo-contractive mappings and multivalued accretive mappings in Banach spaces
scientific article

    Statements

    A perturbed iterative procedure for multivalued pseudo-contractive mappings and multivalued accretive mappings in Banach spaces (English)
    0 references
    20 January 2000
    0 references
    Let \(X\) be a real Banach space, \(K\subset X\) nonempty and convex, and \(T\) a mapping that assigns to each \(x\in K\) a nonempty closed subset of \(K\). Starting from \(x_0\in K\) define the iteration procedure \[ y_n\in(1-\beta_n)x_n+\beta_nTx_n+\beta_nf_n,\quad x_{n+1}\in(1-\alpha_n)x_n+\alpha_nTy_n+\alpha e_n, \] where \(\alpha_n,\beta_n\in[0,1]\) and \((e_n)\), \((f_n)\) are bounded sequences in \(X\) which have to be chosen in such a way that \(x_n,y_n\in K\). The authors formulate conditions which ensure that this procedure converges to the unique fixed point of \(T\) in case \(T\) is ``strongly pseudo-contractive'' (provided the fixed point set is nonempty) and similarly for the unique solution to the equation \(f\in Tx\) in the case of strongly accretive mappings (provided there is a solution).
    0 references
    fixed point
    0 references
    multivalued map
    0 references
    accretive map
    0 references
    iteration procedure
    0 references
    0 references
    0 references

    Identifiers

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