Saima Kanwal, Naeem Saleem, Mi Zhou, Asima Razzaque
Abstract In this article, we present a hybrid algorithm designed to find the global minimum of the best proximity points for a proximal b -enriched nonexpansive mapping, named as enriched best proximity point. We also provide proof of strong convergence for our proposed method, under appropriate conditions in real Hilbert spaces. To demonstrate effectively enriched nonexpansiveness of our approach, we include numerical examples. Furthermore, we apply our results to solve a split feasibility problem in Hilbert spaces.