Fixed Point and Convergence Results for Nonexpansive Set-Valued Mappings

Author(s):  
Simeon Reich ◽  
Alexander J. Zaslavski
2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Jinlu Li ◽  
Ying Liu ◽  
Hongya Gao

We apply the extensions of the Abian-Brown fixed point theorem for set-valued mappings on chain-complete posets to examine the existence of generalized and extended saddle points of bifunctions defined on posets. We also study the generalized and extended equilibrium problems and the solvability of ordered variational inequalities on posets, which are equipped with a partial order relation and have neither an algebraic structure nor a topological structure.


Author(s):  
H. Saberi Najafi ◽  
S. A. Edalatpanah

In the present chapter, we give an overview of iterative methods for linear complementarity problems (abbreviated as LCPs). We also introduce these iterative methods for the problems based on fixed-point principle. Next, we present some new properties of preconditioned iterative methods for solving the LCPs. Convergence results of the sequence generated by these methods and also the comparison analysis between classic Gauss-Seidel method and preconditioned Gauss-Seidel (PGS) method for LCPs are established under certain conditions. Finally, the efficiency of these methods is demonstrated by numerical experiments. These results show that the mentioned models are effective in actual implementation and competitive with each other.


Mathematics ◽  
2019 ◽  
Vol 7 (7) ◽  
pp. 586 ◽  
Author(s):  
Awais Asif ◽  
Muhammad Nazam ◽  
Muhammad Arshad ◽  
Sang Og Kim

In this paper, we noticed that the existence of fixed points of F-contractions, in F -metric space, can be ensured without the third condition (F3) imposed on the Wardowski function F : ( 0 , ∞ ) → R . We obtain fixed points as well as common fixed-point results for Reich-type F-contractions for both single and set-valued mappings in F -metric spaces. To show the usability of our results, we present two examples. Also, an application to functional equations is presented. The application shows the role of fixed-point theorems in dynamic programming, which is widely used in computer programming and optimization. Our results extend and generalize the previous results in the existing literature.


1999 ◽  
Vol 32 (2) ◽  
Author(s):  
Duran Tiirkoglu ◽  
Orhan Özer ◽  
Brian Fisher

Sign in / Sign up

Export Citation Format

Share Document