A new convergence theorem for Steffensen's method on Banach spaces and applications.
A new general iterative method for a finite family of nonexpansive mappings in Hilbert spaces.
A new hybrid algorithm for a system of mixed equilibrium problems, fixed point problems for nonexpansive semigroup, and variational inclusion problem.
A new hybrid algorithm for variational inclusions, generalized equilibrium problems, and a finite family of quasi-nonexpansive mappings.
A new hybrid iterative algorithm for fixed-point problems, variational inequality problems, and mixed equilibrium problems.
A new iteration method for nonexpansive mappings and monotone mappings in Hilbert spaces.
A new iteration process for approximation of common fixed points for finite families of total asymptotically nonexpansive mappings.
A new iterative algorithm for approximating common fixed points for asymptotically nonexpansive mappings.
A new iterative algorithm for the set of fixed-point problems of nonexpansive mappings and the set of equilibrium problem and variational inequality problem.
A new iterative method for finding common solutions of a system of equilibrium problems, fixed-point problems, and variational inequalities.
A new iterative method for solving equilibrium problems and fixed point problems for infinite family of nonexpansive mappings.
A new iterative scheme for countable families of weak relatively nonexpansive mappings and system of generalized mixed equilibrium problems.
A new Kantorovich-type theorem for Newton's method
A new Kantorovich-type convergence theorem for Newton's method is established for approximating a locally unique solution of an equation F(x)=0 defined on a Banach space. It is assumed that the operator F is twice Fréchet differentiable, and that F', F'' satisfy Lipschitz conditions. Our convergence condition differs from earlier ones and therefore it has theoretical and practical value.
A new one-step iterative process for common fixed points in Banach spaces.
A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem
In this paper, we present a simultaneous subgradient algorithm for solving the multiple-sets split feasibility problem. The algorithm employs two extrapolated factors in each iteration, which not only improves feasibility by eliminating the need to compute the Lipschitz constant, but also enhances flexibility due to applying variable step size. The convergence of the algorithm is proved under suitable conditions. Numerical results illustrate that the new algorithm has better convergence than the...
A new strong convergence theorem for equilibrium problems and fixed point problems in Banach spaces.
A Newton-type method and its application.
A note on asymptotic contractions.
A note on “Common fixed point of multistep noor iteration with errors for a finite family of generalized asymptotically quasi-nonexpansive mappings”.
A note on implicit functions in locally convex spaces.