Approximate Solutions of a Fixed-Point Problem with an Algorithm Based on Unions of Nonexpansive Mappings

Alexander J. Zaslavski ()
Additional contact information
Alexander J. Zaslavski: Department of Mathematics, Technion–Israel Institute of Technology, Haifa 3200003, Israel

Mathematics, 2023, vol. 11, issue 6, 1-7

Abstract: In this paper, we study a fixed-point problem with a set-valued mapping by using an algorithm based on unions of nonexpansive mappings. We show that an approximate solution is reached after a finite number of iterations in the presence of computational errors. This result is an extension of the results known in the literature.

Keywords: convergence analysis; fixed point; nonexpansive mapping; set-valued mapping (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/6/1534/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/6/1534/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:6:p:1534-:d:1103697

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().