نتایج جستجو برای: modified noor iteration
تعداد نتایج: 292622 فیلتر نتایج به سال:
we study the convergence of the modified noor iterative scheme for the class of asymptotically pseudocontractive mappings in the intermediate sense which is not necessarily lipschitzian. our results improves, extends and unifies the results of schu [23] and qin {it et al.} [25].
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...
Let K be a nonempty compact convex subset of a uniformly convex Banach space, and K K T : a multivalued nonexpansive mapping. We prove that the sequences of Noor iterate converge to a fixed point of T. This generalizes former results proved by Banach convergence of Noor iterates for a multi-valued mapping with a fixed point. We also introduce both of the iterative processes in a new sen...
Effect of external factors on intention–behaviour gap Sedigheh Moghavvemi, Noor Akma Mohd Salleh, Ainin Sulaiman & Masoud Abessi To cite this article: Sedigheh Moghavvemi, Noor Akma Mohd Salleh, Ainin Sulaiman & Masoud Abessi (2015) Effect of external factors on intention–behaviour gap, Behaviour & Information Technology, 34:12, 1171-1185, DOI: 10.1080/0144929X.2015.1055801 To link to this arti...
We study the convergence of the modified Noor iterative scheme for the class of asymptotically pseudocontractive mappings in the intermediate sense which is not necessarily Lipschitzian. Our results improves, extends and unifies the results of Schu [23] and Qin {it et al.} [25].
We consider the infinite-horizon γ-discounted optimal control problem formalized by Markov Decision Processes. Running any instance of Modified Policy Iteration—a family of algorithms that can interpolate between Value and Policy Iteration—with an error at each iteration is known to lead to stationary policies that are at least 2γ (1−γ)2 -optimal. Variations of Value and Policy Iteration, that ...
We use the technique of updating the solution to suggest and analyze a class of new splitting methods for solving general mixed variational inequalities. It is shown that these modified methods converge for pseudomonotone operators, which is a weaker condition than monotonicity. Our methods differ from the known threestep forward-backward splitting of Glowinski, Le Tallec, and M. A. Noor for so...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید