Cyclic admissible contraction and applications to functional equations in dynamic programming (Q288149)

From MaRDI portal
Revision as of 00:45, 12 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
Cyclic admissible contraction and applications to functional equations in dynamic programming
scientific article

    Statements

    Cyclic admissible contraction and applications to functional equations in dynamic programming (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2016
    0 references
    common fixed point
    0 references
    point of coincidence
    0 references
    \(T\)-cyclic \((\alpha,\beta)\)-admissible mapping
    0 references
    weakly compatible mappings
    0 references
    functional equations
    0 references
    altering distance function
    0 references
    0 references
    0 references
    0 references

    Identifiers

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