Global Convergence of Algorithms Based on Unions of Non-Expansive Maps

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

Mathematics, 2023, vol. 11, issue 14, 1-11

Abstract: In his recent research, M. K. Tam (2018) considered a framework for the analysis of iterative algorithms which can be described in terms of a structured set-valued operator. At each point in the ambient space, the value of the operator can be expressed as a finite union of values of single-valued para-contracting operators. He showed that the associated fixed point iteration is locally convergent around strong fixed points. In the present paper we generalize the result of Tam and show the global convergence of his algorithm for an arbitrary starting point. An analogous result is also proven for the Krasnosel’ski–Mann iterations.

Keywords: convergence analysis; fixed point; non-expansive mapping; para-contracting operator (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/14/3213/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/14/3213/ (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:14:p:3213-:d:1199752

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 ().