Search

The purpose of this paper is to introduce and consider a new hybrid shrinking projection algorithm for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of a system of variational inequality problems, the set of solutions of a system of optimization problems, the common fixed point set of a uniformly closed family of countable quasi-Bregman strictly pseudocontractive mappings in reflexive Banach spaces. Strong convergence theorems have been proved under the appropriate conditions. The main innovative points in this paper are as follows: (1) the notion of the uniformly closed family of countable quasi-Bregman strictly pseudocontractive mappings is presented and the useful conclusions are given; (2) the relative examples of the uniformly closed family of countable quasi-Bregman strictly pseudocontractive mappings are given in classical Banach spaces $l^{2}$ and $L^{2}$; (3) the hybrid shrinking projection method presented in this paper modified some mistakes in the recent result of Ugwunnadi et al. (Fixed Point Theory Appl. 2014:231, 2014). These new results improve and extend the previously known ones in the literature. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to present accelerations of the Mann and CQ algorithms. We first apply the Picard algorithm to the smooth convex minimization problem and point out that the Picard algorithm is the steepest descent method for solving the minimization problem. Next, we provide the accelerated Picard algorithm by using the ideas of conjugate gradient methods that accelerate the steepest descent method. Then, based on the accelerated Picard algorithm, we present accelerations of the Mann and CQ algorithms. Under certain assumptions, we show that the new algorithms converge to a fixed point of a nonexpansive mapping. Finally, we show the efficiency of the accelerated Mann algorithm by numerically comparing with the Mann algorithm. A numerical example is provided to illustrate that the acceleration of the CQ algorithm is ineffective. [ABSTRACT FROM AUTHOR]

A new convex feasibility problem, the split equality problem (SEP), has been proposed by Moudafi and Byrne. The SEP was solved through the ACQA and ARCQA algorithms. In this paper the SEPs are extended to infinite-dimensional SEPs in Hilbert spaces and we established the strong convergence of a proposed algorithm to a solution of general split equality problems (GSEPs). [ABSTRACT FROM AUTHOR]

In this paper we prove the strong convergence of an iterative sequence for finding a common element of the fixed points set of a strictly pseudocontractive mapping and the solution set of the constrained convex minimization problem for a convex and continuously Fréchet differentiable functional in a real Hilbert space. We apply our result to solving the split feasibility problem and the convexly constrained linear inverse problem involving the fixed point problem for a strictly pseudocontractive mapping in a real Hilbert space. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to study a viscosity iterative algorithm for finding a common element of the set of solutions of a general variational inequality problem for two inverse strongly accretive operators and the set of fixed points of a δ-strict pseudocontraction in a real q-uniformly smooth Banach space. Some strong convergence theorems are obtained under appropriate conditions. As an application, we prove some strong convergence theorems for fixed point problems and variational inequality problems or equilibrium problems in Hilbert spaces. These results improve and extend the corresponding results announced by many others. [ABSTRACT FROM AUTHOR]

The split common fixed point problem for two quasi-pseudo-contractive operators is studied. Some properties for quasi-pseudo-contractive operators are presented. An iterative algorithm for solving the split common fixed point problem for two quasi-pseudo-contractive operators is constructed. Strong convergence theorems are proved. A unified framework for the study of this class problem and class of operators is provided. [ABSTRACT FROM AUTHOR]

The article focuses on a three-step iterative algorithm for a general quasi-variational inequality problem. The authors use retraction mapping and fixed point method to study the solution of a general quasi-variational inequality problem. They suggest the application of projection and auxiliary principle methods to study variational inequalities. They note that three-step iterative algorithms are a natural generalization of the splitting methods for solving partial differential equations.