IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i1p55-d304276.html
   My bibliography  Save this article

Existence of a Unique Fixed Point for Nonlinear Contractive Mappings

Author

Listed:
  • Simeon Reich

    (Department of Mathematics, The Technion—Israel Institute of Technology, Haifa 32000, Israel)

  • Alexander J. Zaslavski

    (Department of Mathematics, The Technion—Israel Institute of Technology, Haifa 32000, Israel)

Abstract

In a recent work, we established the existence of a unique fixed point for nonlinear contractive self-mappings of a bounded and closed set in a Banach space. In the present paper we extend this result to the case of unbounded sets.

Suggested Citation

  • Simeon Reich & Alexander J. Zaslavski, 2020. "Existence of a Unique Fixed Point for Nonlinear Contractive Mappings," Mathematics, MDPI, vol. 8(1), pages 1-7, January.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:1:p:55-:d:304276
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/1/55/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/1/55/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Alexander J. Zaslavski, 2018. "Algorithms for Solving Common Fixed Point Problems," Springer Optimization and Its Applications, Springer, number 978-3-319-77437-4, September.
    2. Alexander J. Zaslavski, 2016. "Approximate Solutions of Common Fixed-Point Problems," Springer Optimization and Its Applications, Springer, number 978-3-319-33255-0, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Simeon Reich & Alexander J. Zaslavski, 2021. "Contractive Mappings on Metric Spaces with Graphs," Mathematics, MDPI, vol. 9(21), pages 1-8, November.
    2. Simeon Reich & Alexander J. Zaslavski, 2020. "On a Class of Generalized Nonexpansive Mappings," Mathematics, MDPI, vol. 8(7), pages 1-8, July.
    3. Alexander J. Zaslavski, 2023. "Approximate Solutions of a Fixed-Point Problem with an Algorithm Based on Unions of Nonexpansive Mappings," Mathematics, MDPI, vol. 11(6), pages 1-7, March.
    4. Hu, Yaohua & Li, Gongnong & Yu, Carisa Kwok Wai & Yip, Tsz Leung, 2022. "Quasi-convex feasibility problems: Subgradient methods and convergence rates," European Journal of Operational Research, Elsevier, vol. 298(1), pages 45-58.
    5. Yair Censor & Daniel Reem & Maroun Zaknoon, 2022. "A generalized block-iterative projection method for the common fixed point problem induced by cutters," Journal of Global Optimization, Springer, vol. 84(4), pages 967-987, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:1:p:55-:d:304276. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.