The purpose of this paper is to establish some weak convergence theorems of modified two-step iteration process with errors for two asymptotically quasi-nonexpansive non-self mappings in the setting of real uniformly convex Banach spaces if E satisfies Opial’s condition or the dual E∗ of E has the Kedec-Klee property. Our results extend and improve some known corresponding results from the exis...

In this paper‎, ‎we suggest a fifth order convergence three-step method for solving system of nonlinear equations‎. ‎Each iteration of the method requires two function evaluations‎, ‎two first Fr'{e}chet derivative evaluations and two matrix inversions‎. ‎Hence‎, ‎the efficiency index is $5^{1/({2n+4n^{2}+frac{4}{3}n^{3}})}$‎, ‎which is better than that of other three-step methods‎. ‎The advant...

In this paper, we introduce an iteration process for approximating common fixed points of two nonself asymptotically nonexpansive mappings in Banach spaces. Our process contains Mann iteration process and some other processes for nonself mappings but is independent of Ishikawa iteration process. We prove some weak and strong convergence theorems for this iteration process. Our results generaliz...

(b) (c) (d) (e) (f) Fig. 4. Example of the algorithm's performance. (a), (b) Phase 1, hand reorientation; (c) to (f) { hand approach and grasp execution: (c) a rst contact with the object is made, (d),(e) two intermediate positions. The nal position is shown in (f) and in Figure 5. Fig. 5. Two views of the nal position of the hand and the object shown in Figure 4(f). References 1] C. Laugier, A...

Abstract In this paper, we propose two hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem. Based on algorithm, firstly add term into iteration to accelerate convergence of and adopt flexible rules selecting stepsize shrinking region, which makes an optimal available at each iteration. The region is intersection three sets, are set C hyperplanes. ...

b c d e f Fig. 4. Example of the algorithm's performance. a, b Phase 1, hand reorientation; c to f hand approach and grasp execution: c a rst contact with the object is made, d,e two i n termediate positions. The nal position is shown in f and in Figure 5. Fig. 5. Two views of the nal position of the hand and the object shown in Figure 4f. 88 D. Reznik and V. Lumelsky. Sensor-based motion plann...

We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...

The EM algorithm is a popular and useful algorithm for "nding the maximum likelihood estimator in incomplete data problems. Each iteration of the algorithm consists of two simple steps: an E-step, in which a conditional expectation is calculated, and an M-step, where the expectation is maximized. In some problems, however, the EM algorithm cannot be applied since the conditional expectation req...