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

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

2009
S. Imnang S. Suantai

and Applied Analysis 3 where {an}, {bn}, {αn} are appropriate sequences in 0, 1 . The theory of three-step iterative scheme is very rich, and this scheme, in the context of one or more mappings, has been extensively studied e.g., see Khan et al. 6 , Plubtieng and Wangkeeree 7 , Fukhar-ud-din and Khan 5 , Petrot 13 , and Suantai 14 . It has been shown in 15 that three-step method performs better...

2008
Rabian Wangkeeree Uthai Kamraksa U. Kamraksa

In this paper, we introduce a modified extragradient approximation method for finding the common element of the set of fixed points of nonexpansive mapping, the set of solutions of an equilibrium problem and the set of solutions of the variational inequality. We show that the sequence converges strongly to a common element of the above three sets under some parameters controlling conditions. Ou...

2007
Yongfu Su Xiaolong Qin

Tae-Hwa Kim and Hong-Kun Xu [Strong convergence of modified Mann iterations for asymptotically nonexpansive mappings and semigroups, Nonlinear Analysis 64(2006)1140-1152 ] proved the strong convergence theorems of modified Mann iterations for asymptotically nonexpansive mappings and semigroups on bounded subset C of a Hilbert space by the CQ iteration method. The purpose of this paper is to mod...

2005
Hongmei Chi Peter Beerli Deidre W. Evans Michael Mascagni

The Soból sequence is the most popular quasirandom sequence because of its simplicity and efficiency in implementation. We summarize aspects of the scrambling technique applied to Soból sequences and propose a new simpler modified scrambling algorithm, called the multi-digit scrambling scheme. Most proposed scrambling methods randomize a single digit at each iteration. In contrast, our multi-di...

2017
STEFANIA CORSARO VALENTINA DE SIMONE

We consider the l1-regularized Markowitz model, where a l1-penalty term is added to the objective function of the classical mean-variance one to stabilize the solution process, promoting sparsity in the solution and avoiding short positions. In this paper, we consider the Bregman iteration method to solve the related constrained optimization problem. We propose an iterative algorithm based on a...

2006
S. PLUBTIENG

Let K be a subset of a real normed linear space E and let T be a self-mapping on K . T is said to be nonexpansive provided ‖Tx−Ty‖ ‖x− y‖ for all x, y ∈ K . Fixed-point iteration process for nonexpansive mappings in Banach spaces including Mann and Ishikawa iteration processes has been studied extensively by many authors to solve the nonlinear operator equations in Hilbert spaces and Banach spa...

Journal: :Monatshefte für Mathematik 2021

Abstract In recent years, researchers have studied the use of different iteration processes from fixed point theory in generation complex fractals. For instance, Mann, Ishikawa, Noor, Jungck–Mann and Jungck–Ishikawa iterations been used. this paper, we study Picard–Mann with s -convexity Mandelbrot Julia sets. We prove escape criterion for $$(k+1)$$ <mml:math xmlns:mml="http://www.w3.org/1998/M...

Journal: :amirkabir international journal of modeling, identification, simulation & control 2015
s. s. nourazar h. tamim s. khalili a. mohammadzadeh

in this paper, we present a comparative study between the modified variational iteration method (mvim) and a hybrid of fourier transform and variational iteration method (ftvim). the study outlines the efficiencyand convergence of the two methods. the analysis is illustrated by investigating four singular partial differential equations with variable coefficients. the solution of singular partia...

Journal: :Journal of Optimization Theory and Applications 2013

Journal: :Journal of Applied Mathematics 2013

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

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