In this paper we demonstrate that a number of fixed point iteration problems can be solved using a modified Krasnoselskij iteration process, which is much simpler to use than the other iteration schemes that have been defined. 2008 Elsevier Inc. All rights reserved. For maps with a slow enough growth rate, the Banach contraction principle provides the existence and uniqueness of the fixed point...

In this paper, an interior-point algorithm  for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...

in this paper, we deal to obtain some new complexity results for solving semidefinite optimization (sdo) problem by interior-point methods (ipms). we define a new proximity function for the sdo by a new kernel function. furthermore we formulate an algorithm for a primal dual interior-point method (ipm) for the sdo by using the proximity function and give its complexity analysis, and then we sho...

In this paper, we introduce and study a new iterative scheme toapproximate a common xed point for a nite family of generalized asymptoticallyquasi-nonexpansive nonself-mappings in Banach spaces. Several strong and weakconvergence theorems of the proposed iteration are established. The main resultsobtained in this paper generalize and rene some known results in the currentliterature.

In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.

We discuss techniques for accelerating the self-consistent field iteration for solving the Kohn–Sham equations. These techniques are all based on constructing approximations to the inverse of the Jacobian associated with a fixed point map satisfied by the total potential. They can be viewed as preconditioners for a fixed point iteration. We point out different requirements for constructing prec...

in this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (hlcps). the algorithm uses only full-newton steps which has the advantage that no line searchs are needed. moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.

in this paper, a vector version of the intermediate value theorem is established. the main theorem of this article can be considered as an improvement of the main results have been appeared in [textit{on fixed point theorems for monotone increasing vector valued mappings via scalarizing}, positivity, 19 (2) (2015) 333-340] with containing the uniqueness, convergent of each iteration to the fixe...

‎a full nesterov-todd (nt) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using euclidean jordan algebra‎. ‎two types of‎ ‎full nt-steps are used‎, ‎feasibility steps and centering steps‎. ‎the‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

In this paper, we further investigate the local Hermitian and skew-Hermitian splitting (LHSS) iteration method and the modified LHSS (MLHSS) iteration method for solving generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. When A is non-symmetric positive definite, the convergence conditions are obtained, which generalize some results of Jiang and Cao [M.-Q. Jiang and Y. Ca...