排序方式： 共有13条查询结果，搜索用时 31 毫秒
1.
Convergence analysis of implicit iterative algorithms for asymptotically nonexpansive mappings 总被引：1，自引：0，他引：1
In this paper, we consider the weak and strong convergence of an implicit iterative process with errors for two finite families of asymptotically nonexpansive mappings in the framework of Banach spaces. Our results presented in this paper improve and extend the recent ones announced by many others. 相似文献
2.
Strong convergence of a general iterative algorithm for equilibrium problems and variational inequality problems 总被引：1，自引：0，他引：1
The purpose of this paper is to study the strong convergence of a general iterative scheme to find a common element of the set of common fixed points of a finite family of nonexpansive mappings, the set of solutions of variation inequalities for a relaxed cocoercive mapping and the set of solutions of an equilibrium problem. Our results extend recent results announced by many others. 相似文献
3.
Let E be a uniformly convex Banach space and K a nonempty convex closed subset which is also a nonexpansive retract of E. Let T
_{1}, T
_{2} and T
_{3}: K → E be asymptotically nonexpansive mappings with {k
_{
n
}}, {l
_{
n
}} and {j
_{
n
}}. [1, ∞) such that Σ
_{
n=1}
^{∞}
(k
_{
n
} − 1) < ∞, Σ
_{
n=1}
^{∞}
(l
_{
n
} − 1) < ∞ and Σ
_{
n=1}
^{∞}
(j
_{
n
} − 1) < ∞, respectively and F nonempty, where F = {x ∈ K: T
_{1x
} = T
_{2x
} = T
_{3}
x} = x} denotes the common fixed points set of T
_{1}, _{T}
_{2} and T
_{3}. Let {α
_{
n
}}, {α′
_{
n
}} and {α″
_{
n
}} be real sequences in (0, 1) and ∈ ≤ {α
_{
n
}}, {α′
_{
n
}}, {α″
_{
n
}} ≤ 1 − ∈ for all n ∈ N and some ∈ > 0. Starting from arbitrary x
_{1} ∈ K define the sequence {x
_{
n
}} by
(i) If the dual E* of E has the KadecKlee property then {x
_{
n
}} converges weakly to a common fixed point p ∈ F; (ii) If T satisfies condition (A′) then {x
_{
n
}} converges strongly to a common fixed point p ∈ F.
相似文献
4.
Meijuan Shang Chao Zhang Naihua Xiu 《Journal of Optimization Theory and Applications》2014,163(3):795814
In this paper, we study minimal zero norm solutions of the linear complementarity problems, defined as the solutions with smallest cardinality. Minimal zero norm solutions are often desired in some real applications such as bimatrix game and portfolio selection. We first show the uniqueness of the minimal zero norm solution for Zmatrix linear complementarity problems. To find minimal zero norm solutions is equivalent to solve a difficult zero norm minimization problem with linear complementarity constraints. We then propose a p norm regularized minimization model with p in the open interval from zero to one, and show that it can approximate minimal zero norm solutions very well by sequentially decreasing the regularization parameter. We establish a threshold lower bound for any nonzero entry in its local minimizers, that can be used to identify zero entries precisely in computed solutions. We also consider the choice of regularization parameter to get desired sparsity. Based on the theoretical results, we design a sequential smoothing gradient method to solve the model. Numerical results demonstrate that the sequential smoothing gradient method can effectively solve the regularized model and get minimal zero norm solutions of linear complementarity problems. 相似文献
5.
In this paper, we introduce a multiplestep iterative process for approximating a fixed point of nonexpansive mappings in the framework of uniformly smooth Banach spaces and reflexive Banach spaces which have a weakly continuous duality map, respectively. The results presented in this paper improve and extend the corresponding results of announced by many others. 相似文献
6.
Let K be a nonempty closed convex subset of a real Hilbert space H such that K ± K ⊂ K, T: K → H a kstrict pseudocontraction for some 0 ⩽ k < 1 such that F(T) = {x ∈ K: x = Tx} ≠ $
\not 0
$
\not 0
. Consider the following iterative algorithm given by
$
\forall x_1 \in K,x_{n + 1} = \alpha _n \gamma f(x_n ) + \beta _n x_n + ((1  \beta _n )I  \alpha _n A)P_K Sx_{n,} n \geqslant 1,
$
\forall x_1 \in K,x_{n + 1} = \alpha _n \gamma f(x_n ) + \beta _n x_n + ((1  \beta _n )I  \alpha _n A)P_K Sx_{n,} n \geqslant 1,
相似文献
7.
In this paper, we modify the normal Mann’s iterative process to have strong convergence for a k$k$strictly pseudocontractive nonself mapping in the framework of Hilbert spaces. Our results improve and extend the corresponding results announced by many others. 相似文献
8.
In this paper, we introduce a new iterative scheme to investigate the problem of finding a common element of the set of common fixed points of a finite family of nonexpansive mappings and the set of solutions of a variational inequality problem for a relaxed cocoercive mapping by viscosity approximate methods. Our results improve and extend the recent ones announced by Chen et al. [J.M. Chen, L.J. Zhang, T.G. Fan, Viscosity approximation methods for nonexpansive mappings and monotone mappings, doi:10.1016/j.jmaa.2006.12.088], Iiduka and Tahakshi [H. Iiduka, W. Takahashi, Strong convergence theorems for nonexpansive mappings and inversestrongly monotone mappings, Nonlinear Anal. 61 (2005) 341–350], Yao and Yao [Y.H. Yao, J.C. Yao, On modified iterative method for nonexpansive mappings and monotone mappings, Appl. Math. Comput, doi:10.1016/j.amc.2006.08.062] and Many others. 相似文献
9.
In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mapping, the set of solutions of the variational inequality for an inversestrongly monotone mapping and the set of solutions of an equilibrium problem in a Hilbert space. We show that the iterative sequence converges strongly to a common element of the three sets. The results of this paper extended and improved the results of H. Iiduka and W. Takahashi [Strong convergence theorems for nonexpansive mappings and inversestrongly monotone mappings, Nonlinear Anal. 61 (2005) 341–350] and S. Takahashi and W. Takahashi [Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 331 (2007) 506–515]. Therefore, by using the above result, an iterative algorithm for the solution of a optimization problem was obtained. 相似文献
10.
The purpose of this paper is to study the strong convergence of a general iterative scheme to find a common element of the set of fixed points of a nonexpansive mapping, the set of solutions of variational inequality for a relaxed cocoercive mapping and the set of solutions of an equilibrium problem. Our results extend the recent results of Takahashi and Takahashi [S. Takahashi, W. Takahashi, Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 331 (2007) 506–515], Marino and Xu [G. Marino, H.K. Xu, A general iterative method for nonexpansive mappings in Hilbert spaces, J. Math. Anal. Appl. 318 (2006) 43–52], Combettes and Hirstoaga [P.L. Combettes, S.A. Hirstoaga, Equilibrium programming in Hilbert spaces, J. Nonlinear Convex Anal. 6 (2005) 486–491], Iiduka and Takahashi, [H. Iiduka, W. Takahashi, Strong convergence theorems for nonexpansive mappings and inversestrongly monotone mappings, Nonlinear Anal. 61 (2005) 341–350] and many others. 相似文献
