In this paper, we introduce a hybrid projection algorithm for two finite families of asymptotically quasi phi-nonexpansive mappings to establish a convergence theorem in smooth, strictly convex, and reflexive Banach s...
详细信息
In this paper, we introduce a hybrid projection algorithm for two finite families of asymptotically quasi phi-nonexpansive mappings to establish a convergence theorem in smooth, strictly convex, and reflexive Banach spaces. As applications, we state the convergence of hybrid projection algorithm for two finite families of asymptotically quasi-nonexpansive mappings in Hilbert spaces and the convergence for a system of equilibrium problems.
In this paper, we introduce two new inertial hybrid projection algorithms for solving the split common solution problem with multiple output sets. We establish the convergence of our proposed algorithms under some mil...
详细信息
In this paper, we introduce two new inertial hybrid projection algorithms for solving the split common solution problem with multiple output sets. We establish the convergence of our proposed algorithms under some mild conditions on the control parameters. Our algorithms do not depend on the norms of the transfer mappings.
The Euclidean projection onto check polytope is the most complicated and time-consuming operation in the alternating direction method of multipliers (ADMM) decoding algorithm for low-density parity-check (LDPC) codes....
详细信息
The Euclidean projection onto check polytope is the most complicated and time-consuming operation in the alternating direction method of multipliers (ADMM) decoding algorithm for low-density parity-check (LDPC) codes. Existing approximate even-vertex projectionalgorithm (EVA) can simplify the projection operation, but yields poor decoding performance. By alternately adopting EVA and other accurate projectionalgorithms, this letter proposes an innovative and simple hybrid projection algorithm (HPA) which can increase the percentage of unuseful projections. Simulation results show that the proposed algorithm can substantially reduce the projection time while achieving better frame error rate (FER) performance when compared with the standard ADMM decoding and the ADMM penalized decoding in the case of avoiding the tedious work of penalty parameter optimization. More importantly, compared with cut search algorithm (CSA), the proposed algorithm can significantly save the average projection time by nearly 80%, and the average decoding time by about 85%.
We introduce three new inertial shrinking projectionalgorithms with multiple inertial effects for solving split common solution problems with multiple output sets. We establish the convergence of the sequences genera...
详细信息
We introduce three new inertial shrinking projectionalgorithms with multiple inertial effects for solving split common solution problems with multiple output sets. We establish the convergence of the sequences generated by our proposed algorithms under some mild conditions on the control parameters. More precisely, we only require the boundedness of the coefficients of the inertial components. Moreover, our algorithms do not depend on the norms of the transfer mappings.
In this paper, a hybrid projection algorithm for a total quasi-asymptotically pseudo-contractive mapping is introduced in a Hilbert space. A strong convergence theorem of the proposed algorithm to a fixed point of a t...
详细信息
In this paper, a hybrid projection algorithm for a total quasi-asymptotically pseudo-contractive mapping is introduced in a Hilbert space. A strong convergence theorem of the proposed algorithm to a fixed point of a total quasi-asymptotically pseudo-contractive mapping is proved. Our main result extends and improves many corresponding results.
In an infinite-dimensional Hilbert space, the normal Mann's iteration has only weak convergence, in general, even for nonexpansive mappings. The purpose of this paper is to modify the normal Mann's iteration t...
详细信息
In an infinite-dimensional Hilbert space, the normal Mann's iteration has only weak convergence, in general, even for nonexpansive mappings. The purpose of this paper is to modify the normal Mann's iteration to have strong convergence for a family of Lipschitz quasi-pseudocontractions in the framework of Hilbert spaces. Our results improve and extend the corresponding ones announced by many others. (C) 2008 Elsevier Ltd. All rights reserved.
The purpose of this paper is to study the strong convergence of fixed points for a family of demi-continuous pseudo-contractions by hybrid projection algorithms in the framework of Hilbert spaces. Our results improve ...
详细信息
The purpose of this paper is to study the strong convergence of fixed points for a family of demi-continuous pseudo-contractions by hybrid projection algorithms in the framework of Hilbert spaces. Our results improve and extend the corresponding results announced by many others.
We first introduce an iterative algorithm for finding solutions of variational inequalities for Lipschitzian and monotone mappings in Hilbert spaces, and then prove a strong convergence theorem by using the modified a...
详细信息
ISBN:
(纸本)9781424447053
We first introduce an iterative algorithm for finding solutions of variational inequalities for Lipschitzian and monotone mappings in Hilbert spaces, and then prove a strong convergence theorem by using the modified algorithm. As its application, we deduce a strong convergence theorem for Lipschitzian and pseudo-contractions in Hilbert spaces. The results presented in this paper extend several known results.
暂无评论