the purpose of this paper is to propose a compositeiterative scheme for approximating a common solution for a finitefamily of m-accretive operators in a strictly convex banach spacehaving a uniformly gateaux differentiable norm. as a consequence,the strong convergence of the scheme for a common fixed point ofa finite family of pseudocontractive mappings is also obtained.

the purpose of this paper is to propose a compositeiterative scheme for approximating a common solution for a finitefamily of m-accretive operators in a strictly convex banach spacehaving a uniformly gateaux differentiable norm. as a consequence,the strong convergence of the scheme for a common fixed point ofa finite family of pseudocontractive mappings is also obtained.

A new general composite implicit random iteration scheme with perturbed mapping is proposed and obtain necessary and sufficient conditions for strong convergence of proposed iteration scheme to random fixed point of a finite family of random nonexpansive mappings are obtained.

In this paper, we prove the strong convergence of the composite Halpern-type iteration for a family of nonexpansive mappings in CAT(0) spaces and compare our results with several recent results in this subject. Also, the inexact version of the Halpern iteration is studied in CAT(0) spaces.

This paper presents a new method for a composite dictionary matching pursuit algorithm, which is applied to vibration sensor signal feature extraction and fault diagnosis of a gearbox. Three advantages are highlighted in the new method. First, the composite dictionary in the algorithm has been changed from multi-atom matching to single-atom matching. Compared to non-composite dictionary single-...

Abstract. We propose a new class of primal-dual Fejér monotone algorithms for solving systems of composite monotone inclusions. Our construction is inspired by a framework used by Eckstein and Svaiter for the basic problem of finding a zero of the sum of two monotone operators. At each iteration, points in the graph of the monotone operators present in the model are used to construct a half-spa...

The recently developed perturbation iteration method is applied to boundary layer type singular problems for the first time. As a preliminary work on the topic, the simplest algorithm of PIA(1,1) is employed in the calculations. Linear and nonlinear problems are solved to outline the basic ideas of the new solution technique. The inner and outer solutions are determined with the iteration algor...

We propose and study the iteration-complexity of an inexact version of the Spingarn’s partial inverse method. Its complexity analysis is performed by viewing it in the framework of the hybrid proximal extragradient (HPE) method, for which pointwise and ergodic iteration-complexity has been established recently by Monteiro and Svaiter. As applications, we propose and analyze the iteration-comple...