‎The proximal point algorithm‎, ‎which is a well-known tool for finding‎ ‎minima of convex functions‎, ‎is generalized from the classical‎ ‎Hilbert space framework into a nonlinear setting‎, ‎namely‎, ‎geodesic‎ ‎metric spaces of nonpositive curvature‎. ‎In this paper we propose an‎  ‎iterative algorithm for finding the common element of the‎ ‎minimizers of a finite family of convex functions a...

Although MATLAB is a powerful algorithm development tool, many of its benefits are reduced during the fixed-point conversion process. For example, new mathematical errors are introduced into the algorithm because of the reduced precision of the fixed-point arithmetic. You must rewrite code to replace high-level functions and operators with low-level models that reflect the actual hardware macro...

Existence of fixed point in orthogonal metric spaces has been initiated recently by Eshaghi and et al. [On orthogonal sets and Banach fixed Point theorem, Fixed Point Theory, in press]. In this paper, we introduce the notion of the strongly orthogonal sets and prove a genuine generalization of Banach' fixed point theorem and Walter's theorem. Also, we give an example showing that our main theor...

‎in this paper‎, ‎generalized convex contractions on orthogonal metric spaces are stablished in whath might be called their definitive versions‎. ‎also, we show that‎ there are examples which show that our main theorems are genuine generalizations of theorem 3.1 and 3.2 of cite{r}‎[ m.a. miandaragh, m. postolache, s. rezapour, ‎textit{approximate fixed points of generalizedconvex contractions},...

begin{abstract} in this paper, we introduce an iterative method for amenable semigroup of non expansive mappings and infinite family of non expansive mappings in the frame work of hilbert spaces. we prove the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem. the results present...