Kannan's fixed point approximation for solving split feasibility and variational inequality problems (Q2222166)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Kannan's fixed point approximation for solving split feasibility and variational inequality problems
scientific article

    Statements

    Kannan's fixed point approximation for solving split feasibility and variational inequality problems (English)
    0 references
    3 February 2021
    0 references
    The authors study new fixed point theorems in normed spaces \((X, \Vert\cdot\Vert)\), compare them with previous results, and also indicate some applications. Given \(k\in[0,\infty)\) and \(a\in[0, 1/2)\), they prove a fixed point theorem for so-called \((k,a)\)-enriched Kannan mappings \(T: X\to X\) satisfying \[\Vert k(x-y)+ Tx- Ty\Vert\le a(\Vert x- Tx\Vert+ \Vert y- Ty\Vert)\quad(x,y\in X).\] Since the maps introduced by \textit{R. Kannan} [Bull. Calcutta Math. Soc. 60, 71--76 (1968; Zbl 0209.27104)] are \((0,a)\)-enriched Kannan maps, this extends Kannan's fixed point theorem. Similarly, given \(k\in[0,\infty)\) and \(k\in[0,1)\), they prove a fixed point theorem for so-called \((k,h)\)-enriched Bianchini mappings \(T: X\to X\) satisfying \[\Vert k(x- y)+ Tx- Ty\Vert\le h\max\{\Vert x- Tx\Vert,\Vert y- Ty\Vert\}\qquad (x,y\in X).\] Since the maps introduced by \textit{R. M. Tiberio Bianchini} [Boll. Unione Mat. Ital., IV. Ser. 5, 103--108 (1972; Zbl 0249.54023)] are \((0,h)\)-enriched Bianchini maps, this extends Bianchini's fixed point theorem.
    0 references
    enriched Kannan mapping
    0 references
    enriched Bianchini mapping
    0 references
    fixed point
    0 references
    Krasnoselskij iteration
    0 references
    split feasibility problem
    0 references
    variational inequality problem
    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
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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