Let X, d be a complete metric space and T a self-map of X. Let xn 1 f T, xn be some iteration procedure. Suppose that F T , the fixed point set of T , is nonempty and that xn converges to a point q ∈ F T . Let {yn} ⊂ X and define n d yn 1, f T, yn . If lim n 0 implies that limyn q, then the iteration procedure xn 1 f T, xn is said to be T -stable. Without loss of generality, we may assume that ...

We prove the weak convergence of Mann iteration for a hybrid pair of maps to a common fixed point of a selfmap f and a multivalued f nonexpansive mapping T in Banach space E. Keywords—Common fixed point, Mann iteration, Multivalued mapping, weak convergence.

We develop and compare multilevel algorithms for solving constrained nonlinear variational problems via interior point methods. Several equivalent formulations of the linear systems arising at each iteration of the interior point method are compared from the point of view of conditioning and iterative solution. Furthermore, we show how a multilevel continuation strategy can be used to obtain go...

Maximum likelihood estimations for the parameters of extreme value distributions are discussed in this paper using fixed point iteration. The commonly used numerical approach for adressing this problem is the Newton-Raphson approach which requires differentiation unlike the fixed point iteration which is also easier to implement. Graphical approaches are also usualy proposed in the literature. ...

We develop and compare multilevel algorithms for solving bound constrained nonlinear variational problems via interior point methods. Several equivalent formulations of the linear systems arising at each iteration of the interior point method are compared from the point of view of conditioning and iterative solution. Furthermore, we show how a multilevel continuation strategy can be used to obt...

We develop and compare multilevel algorithms for solving constrained nonlinear variational problems via interior point methods. Several equivalent formulations of the linear systems arising at each iteration of the interior point method are compared from the point of view of conditioning and iterative solution. Furthermore, we show how a multilevel continuation strategy can be used to obtain go...

In this paper, we study the lower iteration complexity bounds for finding saddle point of a strongly convex and concave problem: $\min_x\max_yF(x,y)$. We restrict classes algorithms in our investigation to be either pure first-order methods or using proximal mappings. The existing bound result type problems is obtained via framework monotone variational inequality problems, which corresponds ca...