نتایج جستجو برای: modified halpern iteration

تعداد نتایج: 292563  

Journal: :Mathematical and Computational Applications 2010

Journal: :bulletin of the iranian mathematical society 2012
maryam zangiabadi hossein mansouri

we present a modified version of the infeasible-interior- we present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by mansouri et al. (nonlinear anal. real world appl. 12(2011) 545--561). each main step of the algorithm consists of a feasibility step and several centering steps. we use a different feasibility step, which targ...

Journal: :Computers & Mathematics with Applications 2007

2006
Jian-Feng Cai Michael K. Ng Yimin Wei

Newton’s iteration is modified for the computation of the group inverses of singular Toeplitz matrices. At each iteration, the iteration matrix is approximated by a matrix with a low displacement rank. Because of the displacement structure of the iteration matrix, the matrix-vector multiplication involved in Newton’s iteration can be done efficiently. We show that the convergence of the modifie...

Journal: :Arabian Journal of Mathematics 2022

Abstract In this paper, we introduce and study a modified Halpern-type proximal point algorithm which comprises finite family of resolvents mixed equilibrium problems k -demimetric mappings. We prove that the converges strongly to common solution problems, is also fixed mappings in Hadamard space. Furthermore, give numerical example our show applicability algorithm.

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

2012
Nguyen Buong Nguyen Duc Lang

In this paper, we introduce some new iteration methods based on the hybrid method in mathematical programming, the Mann’s iterative method and the Halpern’s method for finding a fixed point of a nonexpansive mapping and a common fixed point of a nonexpansive semigroup Hilbert spaces. Mathematics Subject Classification: 41A65, 47H17, 47H20

Journal: :mathematics interdisciplinary research 0
rashwan ahmed rashwan department of mathematics, faculty of science, assuit university, assuit 71516, egypt hasanen abuelmagd hammad department of mathematics, faculty of science, sohag university, sohag 82524, egypt

the purpose of this paper is to study the convergence and the almost sure t-stability of the modi ed sp-type random iterative algorithm in a separable banach spaces. the bochner in-tegrability of andom xed points of this kind of random operators, the convergence and the almost sure t-stability for this kind of generalized asymptotically quasi-nonexpansive random mappings are obtained. our resu...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید