This paper addresses the non-linear programming problem of globally minimizing the real valued function x⟶d(x,Sx) where S is a generalized proximal contraction in the setting of a metric space. Eventually, one can obtain optimal approximate solutions to some fixed-point equations in the event...

The primary goal of this work is to address the non-linear programming problem of globally minimizing the real valued function x → d(x, Tx) where T is presumed to be a non-self mapping that is a generalized proximal contraction in the setting of a metric space. Indeed, an iterative algorithm...