نتایج جستجو برای: fixed point iteration
تعداد نتایج: 715482 فیلتر نتایج به سال:
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...
The purpose of this paper is to study the strong convergence of an implicit iteration process with errors to a common fixed point for a finite family of asymptotically pseudocontractive mappings and nonexpansive mappings in normed linear spaces. The results in this paper improve and extend the corresponding results of Xu and Ori, Zhou and Chang, Sun, Yang and Yu in some aspects.
The search for finding the local minimization in unconstrained optimization problems and a fixed point of the gradient system of ordinary differential equations are two close problems. Limited-memory algorithms are widely used to solve large-scale problems, while Rang Kuta's methods are also used to solve numerical differential equations. In this paper, using the concept of sub-space method and...
In this paper, two examples of quasi-firmly type nonexpansive mappings are given to prove that the concept is different from nonexpansive mapping. Furthermore, it is studied to the convergence of the sequence of successive approximations for this class of mappings only when the super limit of iteration coefficients is less than 1. In particular, the Picard iteration {T x0} of such a mapping con...
We focus on the minimization of regularized objective functions using the popular half-quadratic approach introduced by Geman and Reynolds in 1992. We show that whenever applicable, this approach is equivalent to the very classical gradient linearization approach, known also as the fixed point iteration.
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.
Aiming at a fast and robust simulation of large multibody systems with contacts and friction, this work presents a novel solution method which can solve large complementarity problems by means of a fixed-point iteration. When thousands of unilateral constraints are added to the system, our method performs like a Banach contractive mapping, providing a fast monotonic approximation to the exact L...
let $c$ be a nonempty closed convex subset of a real hilbert space $h$. let ${s_n}$ and ${t_n}$ be sequences of nonexpansive self-mappings of $c$, where one of them is a strongly nonexpansive sequence. k. aoyama and y. kimura introduced the iteration process $x_{n+1}=beta_nx_n+(1-beta_n)s_n(alpha_nu+(1-alpha_n)t_nx_n)$ for finding the common fixed point of ${s_n}$ and ${t_n}$, where $uin c$ is ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید