The Retraction-Displacement Condition in the Theory of Fixed Point Equation with a Convergent Iterative Algorithm

V. Berinde (), A. Petruşel (), I. A. Rus () and M. A. Şerban ()
Additional contact information
V. Berinde: Baia-Mare North University Center
A. Petruşel: Babeş-Bolyai University
I. A. Rus: Babeş-Bolyai University
M. A. Şerban: Babeş-Bolyai University

A chapter in Mathematical Analysis, Approximation Theory and Their Applications, 2016, pp 75-106 from Springer

Abstract: Abstract Let (X, d) be a complete metric space and f: X → X be an operator with a nonempty fixed point set, i.e., F f : = { x ∈ X : x = f ( x ) } ≠ ∅ $$F_{f}:=\{ x \in X: x = f(x)\}\neq \emptyset$$ . We consider an iterative algorithm with the following properties: (1) for each x ∈ X there exists a convergent sequence (x n (x)) such that x n ( x ) → x ∗ ( x ) ∈ F f $$x_{n}(x) \rightarrow x^{{\ast}}(x) \in F_{f}$$ as n → ∞ $$n \rightarrow \infty$$ ; (2) if x ∈ F f , then x n (x) = x, for all n ∈ ℕ $$n \in \mathbb{N}$$ . In this way, we get a retraction mapping r: X → F f , given by r(x) = x ∗(x). Notice that, in the case of Picard iteration, this retraction is the operator f ∞ $$f^{\infty }$$ , see I.A. Rus (Picard operators and applications, Sci. Math. Jpn. 58(1):191–219, 2003).By definition, the operator f satisfies the retraction-displacement condition if there is an increasing function ψ : ℝ + → ℝ + $$\psi: \mathbb{R}_{+} \rightarrow \mathbb{R}_{+}$$ which is continuous at 0 and satisfies ψ(0) = 0, such that d ( x , r ( x ) ) ≤ ψ ( d ( x , f ( x ) ) , for all x ∈ X . $$\displaystyle{d(x,r(x)) \leq \psi (d(x,f(x)),\mbox{ for all }x \in X.}$$ In this paper, we study the fixed point equation x = f(x) in terms of a retraction-displacement condition. Some examples, corresponding to Picard, Krasnoselskii, Mann and Halpern iterative algorithms, are given. Some new research directions and open questions are also presented.

Keywords: Complete metric space; Fixed point; Weakly Picard operator; Comparison function; φ $$\varphi$$ -Contraction; ψ-Picard operator; The retraction-displacement condition; Iterative algorithm; Krasnoselskii algorithm; Mann algorithm; Halpern algorithm; Ulam-Hyers stability; Well-posedness of the fixed point equation; Ostrowski stability; Multi-valued operator (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:spochp:978-3-319-31281-1_4

Ordering information: This item can be ordered from
http://www.springer.com/9783319312811

DOI: 10.1007/978-3-319-31281-1_4

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().