Some results on generalized equilibrium problems involving strictly pseudocontractive mappings

In this paper,we consider an iterative sequence for generalized equilibrium problems and strictly pseudocontractive mappings.We show that the iterative sequence converges strongly to a common element of the solution set of generalized equilibrium problems and of the fixed point set of strictly pseudocontractive mappings.     

New subgradient extragradient methods for solving monotone bilevel equilibrium problems

ABSTRACT

In this paper, we propose new subgradient extragradient methods for finding a solution of a strongly monotone equilibrium problem over the solution set of another monotone equilibrium problem which usually is called monotone bilevel equilibrium problem in Hilbert spaces. The first proposed algorithm is based on the subgradient extragradient method presented by Censor et al. [Censor Y, Gibali A, Reich S. The subgradient extragradient method for solving variational inequalities in Hilbert space. J Optim Theory Appl. 2011;148:318–335]. The strong convergence of the algorithm is established under monotone assumptions of the cost bifunctions with Lipschitz-type continuous conditions recently presented by Mastroeni in the auxiliary problem principle. We also present a modification of the algorithm for solving an equilibrium problem, where the constraint domain is the common solution set of another equilibrium problem and a fixed point problem. Several fundamental experiments are provided to illustrate the numerical behaviour of the algorithms and to compare with others.     

On the weak convergence of iterative sequences for generalized equilibrium problems and strictly pseudocontractive mappings

In this article we consider the problem of finding a common element in the solution set of generalized equilibrium problems, in the solution set of the classical variational inequality and in the fixed point set of strictly pseudocontractive mappings. Weak convergence theorems of common elements are established in real Hilbert spaces.     

New monotone hybrid algorithm for hemi-relatively nonexpansive mappings and maximal monotone operators

The purpose of this article is to prove the strong convergence theorems for hemi-relatively nonexpansive mappings in Banach spaces. In order to get the strong convergence theorems for hemi-relatively nonexpansive mappings, a new monotone hybrid iteration algorithm is presented and is used to approximate the fixed point of hemi-relatively nonexpansive mappings. Noting that, the general hybrid iteration algorithm can be used for relatively nonexpansive mappings but it can not be used for hemi-relatively nonexpansive mappings. However, this new monotone hybrid algorithm can be used for hemi-relatively nonexpansive mappings. In addition, a new method of proof has been used in this article. That is, by using this new monotone hybrid algorithm, we firstly claim that, the iterative sequence is a Cauchy sequence. The results of this paper modify and improve the results of Matsushita and Takahashi, and some others.     

Convergence theorem for equilibrium problem and Bregman strongly nonexpansive mappings in Banach spaces

In this paper, we present an iterative scheme for Bregman strongly nonexpansive mappings in the framework of Banach spaces. Furthermore, we prove the strong convergence theorem for finding common fixed points with the set of solutions of an equilibrium problem.     

Iterative convergence theorems for maximal monotone operators and relatively nonexpansive mappings

In this paper, some iterative schemes for approximating the common element of the set of zero points of maximal monotone operators and the set of fixed points of relatively nonexpansive mappings in a real uniformly smooth and uniformly convex Banach space are proposed. Some strong convergence theorems are obtained, to extend the previous work.     

A strong convergence theorem for relatively nonexpansive mappings in a Banach space

In this paper, we prove a strong convergence theorem for relatively nonexpansive mappings in a Banach space by using the hybrid method in mathematical programming. Using this result, we also discuss the problem of strong convergence concerning nonexpansive mappings in a Hilbert space and maximal monotone operators in a Banach space.     

New iterative schemes for strongly relatively nonexpansive mappings and maximal monotone operators

In this paper, some new iterative schemes for approximating the common element of the set of fixed points of strongly relatively nonexpansive mappings and the set of zero points of maximal monotone operators in a real uniformly smooth and uniformly convex Banach space are proposed. Some weak convergence theorems are obtained, which extend and complement some previous work.     

A new class of nonexpansive type mappings and fixed points

In this paper a new class of self-mappings on metric spaces, which satisfy the nonexpensive type condition (3) below is introduced and investigated. The main result is that such mappings have a unique fixed point. Also, a remetrization theorem, which is converse to Banach contraction principle is given.27. march 80     

A viscosity approximation scheme for system of equilibrium problems, nonexpansive mappings and monotone mappings

In this paper, we introduce a new viscosity approximation scheme based on the extragradient method for finding a common element of the set of solutions to a system of equilibrium problems, the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions to the variational inequality for a monotone, Lipschitz continuous mapping. Several convergence results for the sequences generated by these processes in Hilbert spaces were derived.     

Strong convergence theorems by Halpern-Mann iterations for relatively nonexpansive mappings in Banach spaces

In this paper, we modify Halpern and Mann’s iterations for finding a fixed point of a relatively nonexpansive mapping in a Banach space. Consequently, a strong convergence theorem for a nonspreading mapping is deduced. Using a concept of duality theorems, we also obtain analogue results for certain generalized nonexpansive and generalized nonexpansive type mappings. Finally, we discuss two strong convergence theorems concerning two types of resolvents of a maximal monotone operator in a Banach space.     

Some results on generalized equilibrium problems involving a family of nonexpansive mappings

In this paper, we introduce an iterative method for finding a common element in the solution set of generalized equilibrium problems, in the solution set of variational inequalities and in the common fixed point set of a family of nonexpansive mappings. Strong convergence theorems are established in the framework of Hilbert spaces.     

The primal douglas-rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem

We apply the Douglas-Rachford splitting algorithm to a class of multi-valued equations consisting of the sum of two monotone mappings. Compared with the dual application of the same algorithm, which is known as the alternating direction method of multipliers, the primal application yields algorithms that seem somewhat involved. However, the resulting algorithms may be applied effectively to problems with certain special structure. In particular we show that they can be used to derive decomposition algorithms for solving the variational inequality formulation of the traffic equilibrium problem. This research was supported in part by the Scientific Research Grant-in-Aid from the Ministry of Education, Science and Culture, Japan.     

The hybrid projection algorithm for finding the common fixed points of nonexpansive mappings and the zeroes of maximal monotone operators in Banach spaces

The proposal of this article is to construct a new modified block by using the hybrid projection method and prove the strong convergence theorem for this method, which include the fixed point set of an infinite family of weak relatively nonexpansive mappings and zeroes of a finite family of maximal monotone operators in a uniformly smooth and strictly convex Banach space with the Kadec–Klee property. The results presented in this article improve and generalize some well-known results in the literature.     

与渐近非扩张半群不动点问题相关的分裂等式混合均衡问题及其应用

研究了与渐近非扩张半群不动点问题相关的分裂等式混合均衡问题.在等式约束下,为同时逼近两个空间中混合均衡问题和渐近非扩张半群不动点问题的公共解,借助收缩投影方法引出了一种迭代程序.在适当条件下,该迭代算法的强收敛性被证明.文末还把所得结果应用于分裂等式混合变分不等式问题和分裂等式凸极小化问题.     

A splitting algorithm for finding fixed points of nonexpansive mappings and solving equilibrium problems

We consider the problem of finding a fixed point of a nonexpansive mapping, which is also a solution of a pseudo-monotone equilibrium problem, where the bifunction in the equilibrium problem is the sum of two ones. We propose a splitting algorithm combining the gradient method for equilibrium problem and the Mann iteration scheme for fixed points of nonexpansive mappings. At each iteration of the algorithm, two strongly convex subprograms are required to solve separately, one for each of the component bifunctions. Our main result states that, under paramonotonicity property of the given bifunction, the algorithm converges to a solution without any Lipschitz-type condition as well as Hölder continuity of the bifunctions involved.     

A trust region algorithm for solving bilevel programming problems

In this paper, we present a new trust region algorithm for a nonlinear bilevel programming problem by solving a series of its linear or quadratic approximation subproblems. For the nonlinear bilevel programming problem in which the lower level programming problem is a strongly convex programming problem with linear constraints, we show that each accumulation point of the iterative sequence produced by this algorithm is a stationary point of the bilevel programming problem.     

Strong convergence theorems for a common fixed point of two hemi-relatively nonexpansive mappings

The purpose of this article is to prove strong convergence theorems for common fixed points of two closed hemi-relatively nonexpansive mappings in Banach spaces. In order to get the strong convergence theorems, the monotone hybrid algorithms are presented and are used to approximate the common fixed points. Finally, a new simplified hybrid algorithm has been proposed and relative convergence theorem has been proved by using the new method for proofs. The results of this article modify and improve the results of Matsushita, Takahashi [S. Matsushita, W. Takahashi, A strong convergence theorem for relatively nonexpansive mappings in a Banach space, J. Approx. Theory 134 (2005) 257–266] and the results of Plubtieng, Ungchittrakool [S. Plubtieng, K. Ungchittrakool, Strong convergence theorems for a common fixed point of two relatively nonexpansive mappings in a Banach space, J. Approx. Theory 149 (2007) 103–115], and many others.     

An iterative method for equilibrium problems and a finite family of relatively nonexpansive mappings in a Banach space

In this paper, we introduce a new iterative method for finding a common element of the set of fixed points of a finite family of relatively nonexpansive mappings and the set of solutions of an equilibrium problem in uniformly convex and uniformly smooth Banach spaces. Then we prove a strong convergence theorem by using the generalized projection.     

Algorithms for nonexpansive self-mappings with application to the constrained multiple-set split convex feasibility fixed point problem in Hilbert spaces

In this article we devise two iteration schemes for approximating common fixed points of a finite family of nonexpansive mappings and establish the corresponding strong convergence theorem for the sequence generated by any one of our algorithms. Then we apply our results to approximate a solution of the so-called constrained multiple-set convex feasibility fixed point problem for firmly nonexpansive mappings which covers the multiple-set convex feasibility problem in the literature. In particular, our algorithms can be used to approximate the zero point problem of maximal monotone operators, and the equilibrium problem. Furthermore, the unique minimum norm solution can be obtained through our algorithms for each mentioned problem.