Existence and Convergence Theorems for Global Minimization of Best Proximity Points in Hilbert Spaces
- 28 Downloads
In order to solve global minimization problems involving best proximity points, we introduce general Mann algorithm for nonself nonexpansive mappings and then prove weak and strong convergence of the proposed algorithm under some suitable conditions in real Hilbert spaces. Furthermore, we also provide numerical experiment to illustrate the convergence behavior of our proposed algorithm.
KeywordsGeneral Mann algorithm Global minimization problem Best proximity point problem Nonexpansive mapping
Mathematics Subject Classification (2010)41A29 90C26 47H09
R. Suparatulatorn and S. Suantai would like to thank the Royal Golden Jubilee (RGJ) Ph.D. Programme (PHD/0021/2559) and Chiang Mai University for the financial support. W. Cholamjiak would like to thank the Thailand Research Fund under the project MRG6080105 and University of Phayao.
- 20.Suparatulatorn, R., Suantai, S.: A new hybrid algorithm for global minimization of best proximity points in Hilbert spaces. Carpath. J. Math. 35(1), 95–102 (2019) Google Scholar