Search

A large number of nonlinear and optimization problems can be reduced to altering point problems. This paper aims to introduce the parallel normal S-iteration technique and study its convergence rates for solving such problems in infinite-dimensional Hilbert spaces under practical assumptions. We place particular emphasis on the parallel splitting method for the sum of two maximal monotone operators and that can apply for solving a class of convex composite minimization problems. Moreover, we present applications of our iterative methods to some nonlinear problems, such as a system of variational inequalities and a system of inclusion problems. Finally, to demonstrate the applicability of the altering point technique, the performances of our proposed parallel normal S-iteration methods are presented through numerical experiments in signal recovery problems. [ABSTRACT FROM AUTHOR]

We study perturbations of a hybrid steepest descent method for locating common fixed points of an arbitrary pool { T λ } of nonexpansive mappings. The difficulty of handling a possibly uncountable family is settled down to dealing with a countable family of auxiliary mappings { S n } associated to { T λ } , in the sense that the approximate fixed points of { S n } provide the common fixed points of { T λ }. Algorithms with strong convergence for solving the associated variational inequality problems are presented. Applications to convex minimization problems and convex feasibility problems are provided, together with numerical examples for comparisons of our algorithms with the existing ones. [ABSTRACT FROM AUTHOR]

In this paper, we introduce and study the generalized-D-gap function for an equilibrium problem. We give sufficient conditions under which a critical point of the generalized-D-gap function is a solution of the equilibrium problem, and develop a descent scheme for locating these critical points. Using the generalized-D-gap function, we construct an error bound for the equilibrium problem. We support our approach with concrete examples. [ABSTRACT FROM AUTHOR]

The Mann iterates behave well for nonexpansive mappings for any initial guess in the domain. Our aim in this article is to extend this method to a broad class of inexact fixed point algorithms generated by nearly nonexpansive sequences in Banach spaces and to locate the weak limit of the iterates by its initial guesses. Due to the inexactness, our algorithms become efficiently applicable for a wider class of problems. As applications, we give convergence theorems for finding solutions of variational inclusion problems and constrained multiple-sets split feasibility problems. Our results are significant refinements and improvements of the corresponding results in the literature. [ABSTRACT FROM AUTHOR]