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… Click to show full abstract
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.
               
Click one of the above tabs to view related content.