Weak convergence theorem for monotone mappings and a countable family of nonexpansive mappings

In this paper, we introduce an iterative process for finding the common element of the set of common fixed points of a countable family of nonexpansive mappings and the set of solutions of the variational inequality problem for an α$\alpha$-inverse-strongly-monotone mapping. We obtain a weak convergence theorem for a sequence generated by this process. Moreover, we apply our result to the problem for finding a common element of the set of equilibrium problems and the set of solutions of the variational inequality problem of a monotone mapping.     

A new hybrid iterative method for mixed equilibrium problems and variational inequality problem for relaxed cocoercive mappings with application to optimization problems

In this paper, we introduce and study a new hybrid iterative method for finding a common element of the set of solutions of a mixed equilibrium problem, the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of variational inequalities for a ξ-Lipschitz continuous and relaxed (m,v)-cocoercive mappings in Hilbert spaces. Then, we prove a strong convergence theorem of the iterative sequence generated by the proposed iterative algorithm which solves some optimization problems under some suitable conditions. Our results extend and improve the recent results of Yao et al. [Y. Yao, M.A. Noor, S. Zainab and Y.C. Liou, Mixed equilibrium problems and optimization problems, J. Math. Anal. Appl (2009). doi:10.1016/j.jmaa.2008.12.005] and Gao and Guo [X. Gao and Y. Guo, Strong convergence theorem of a modified iterative algorithm for Mixed equilibrium problems in Hilbert spaces, J. Inequal. Appl. (2008). doi:10.1155/2008/454181] and many others.     

A hybrid approximation method for equilibrium and fixed point problems for a monotone mapping and a nonexpansive mapping

The purpose of this paper is to present an iterative scheme by a hybrid method for finding a common element of the set of fixed points of a nonexpansive mapping, the set of solutions of an equilibrium problem and the set of solutions of the variational inequality for α-inverse-strongly monotone mappings in the framework of a Hilbert space. We show that the iterative sequence converges strongly to a common element of the above three sets under appropriate conditions. Additionally, the idea of our results are applied to find a zero of a maximal monotone operator and a strictly pseudocontractive mapping in a real Hilbert space.     

A splitting algorithm for a class of bilevel equilibrium problems involving nonexpansive mappings

We propose splitting, parallel algorithms for solving strongly equilibrium problems over the intersection of a finite number of closed convex sets given as the fixed-point sets of nonexpansive mappings in real Hilbert spaces. The algorithm is a combination between the gradient method and the Mann-Krasnosel’skii iterative scheme, where the projection can be computed onto each set separately rather than onto their intersection. Strong convergence is proved. Some special cases involving bilevel equilibrium problems with inverse strongly monotone variational inequality, monotone equilibrium constraints and maximal monotone inclusions are discussed. An illustrative example involving a system of integral equations is presented.     

Contraction of the proximal mapping and applications to the equilibrium problem

In this paper, we introduce a new definition of Lipschitz-type continuity of a bifunction. Using this definition, we prove the contraction of the proximal mapping and apply it to the equilibrium problem over the fixed-point set of a nonexpansive mapping. We present a new algorithm for this problem. Under classical conditions, the convergence of the algorithm is proved. Finally, we present some numerical results for the proposed algorithm.     

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.     

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 of the iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems of an infinite family of nonexpansive mappings

In this paper, we introduce an iterative scheme based on the extragradient approximation method for finding a common element of the set of common fixed points of a countable family of nonexpansive mappings, the set of solutions of a mixed equilibrium problem, and the set of solutions of the variational inequality problem for a monotone L-Lipschitz continuous mapping in a real Hilbert space. Then, the strong convergence theorem is proved under some parameters controlling conditions. Applications to optimization problems are given. The results obtained in this paper improve and extend the recent ones announced by Wangkeeree [R. Wangkeeree, An extragradient approximation method for equilibrium problems and fixed point problems of a countable family of nonexpansive mappings, Fixed Point Theory and Applications (2008) 17. doi:10.1155/2008/134148. Article ID 134148], Kumam and Katchang [P. Kumam, P. Katchang, A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mappings, Nonlinear Anal. Hybrid Syst. (2009) doi:10.1016/j.nahs.2009.03.006] and many others.     

Strong convergence theorems by hybrid methods for a finite family of nonexpansive mappings and inverse-strongly monotone mappings

In this paper, we introduce and study an iterative scheme by a hybrid method for finding a common element of the set of solutions of an equilibrium problem, the set of common fixed points of a finite family of nonexpansive mappings and the set of solutions of the variational inequality for an inverse-strongly-monotone mapping in a real Hilbert space. Then, we prove that the iterative sequence converges strongly to a common element of the three sets. Using this result, we consider the problem of finding a common fixed point of a finite family of nonexpansive mappings and a strictly pseudocontractive mapping and the problem of finding a common element of the set of common fixed points of a finite family of nonexpansive mappings and the set of zeros of an inverse-strongly monotone mapping. The results obtained in this paper extend and improve the several recent results in this area.     

Strong convergence of projection algorithms for a family of relatively quasi-nonexpansive mappings and an equilibrium problem in Banach spaces

In this article, we introduce two kinds of new hybrid projection algorithms for finding a common element of the set of solutions of an equilibrium problem and the set of common fixed points of an infinitely countable family of relatively quasi-nonexpansive mappings in a Banach space. Our main results improve and extend the result obtained by Martinez-Yanes and Xu [Strong convergence of the CQ method for fixed point iteration processes, Nonlinear Anal. 64 (2006), pp. 2400–2411] and the corresponding results.     

A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost

Computing traffic equilibria with a general nonadditive route cost disutility function is considered in this paper. Following the user equilibrium (UE) condition, that is, no driver can unilaterally change route to achieve less travel costs, the traffic equilibrium problem (TEP) can be formulated as a nonlinear complementary problem (NCP). In this paper, we propose a semismooth Newton method with a penalized Fischer–Burmeister (PFB) NCP function to solve the NCP formulation of the TEP, and also, we investigate the properties of the proposed method. Numerical results are provided and compared with the classical TEP with additive route cost functions. The results show the algorithm can achieved substantially better performance than the existing approaches. A sensitivity analysis is also conducted to examine the parameter of the proposed nonadditive route cost function.     

On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators

This paper shows, by means of an operator called asplitting operator, that the Douglas—Rachford splitting method for finding a zero of the sum of two monotone operators is a special case of the proximal point algorithm. Therefore, applications of Douglas—Rachford splitting, such as the alternating direction method of multipliers for convex programming decomposition, are also special cases of the proximal point algorithm. This observation allows the unification and generalization of a variety of convex programming algorithms. By introducing a modified version of the proximal point algorithm, we derive a new,generalized alternating direction method of multipliers for convex programming. Advances of this sort illustrate the power and generality gained by adopting monotone operator theory as a conceptual framework.This paper is drawn largely from the dissertation research of the first author. The dissertation was performed at M.I.T. under the supervision of the second author, and was supported in part by the Army Research Office under grant number DAAL03-86-K-0171, and by the National Science Foundation under grant number ECS-8519058.     

Convergence theorems of a hybrid algorithm for equilibrium problems

In this paper, we introduce a hybrid iterative scheme for finding a common element of the set of common fixed points of two hemi-relatively non-expansive mappings and the set of solutions of an equilibrium problem by the CQ hybrid method in Banach spaces. Our results improve and extend the corresponding results announced by Cheng and Tian [Y. Cheng, M. Tian, Strong convergence theorem by monotone hybrid algorithm for equilibrium problems, hemi-relatively nonexpansive mappings and maximal monotone operators, Fixed Point Theory Appl. 2008 (2008) 12 pages, doi:10.1155/2008/617248], Takahashi and Zembayashi [W. Takahashi, K. Zembayashi, Strong convergence theorem by a new hybrid method for equilibrium problems and relatively non-expansive mappings, Fixed Point Theory Appl. (2008) doi:10.1155/2008/528476] and some others.     

A new method for a class of nonlinear variational inequalities with fuzzy mappings

In this paper, we construct a new iterative algorithm of solution for a new class of nonlinear variational inequalities with fuzzy mappings and give some convergence analysis of iterative sequences generated by algorithm.     

Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs

In this paper, we present an algorithm for solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs. The path cost function considered is comprised of two attributes, travel time and toll, that are combined into a nonlinear generalized cost. Travel demand is determined endogenously according to a travel disutility function. Travelers choose routes with the minimum overall generalized costs. The algorithm involves two components: a bicriteria shortest path routine to implicitly generate the set of non-dominated paths and a projection and contraction method to solve the nonlinear complementarity problem (NCP) describing the traffic equilibrium problem. Numerical experiments are conducted to demonstrate the feasibility of the algorithm to this class of traffic equilibrium problems.     

An iterative method for finding common solutions of equilibrium and fixed point problems

We introduce an iterative method for finding a common element of the set of solutions of an equilibrium problem and of the set of fixed points of a finite family of nonexpansive mappings in a Hilbert space. We prove the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem.     

Weak convergence of a splitting algorithm in Hilbert spaces

In this paper, we present a splitting algorithm with computational errors for solving common solutions of zero point, fixed point and equilibrium problems. Weak convergence theorems of common solutions are established in the framework of real Hilbert spaces.     

Convergence of an iterative algorithm for systems of variational inequalities and nonexpansive mappings with applications

In this paper, we consider the problem of convergence of an iterative algorithm for a system of generalized variational inequalities and a nonexpansive mapping. Strong convergence theorems are established in the framework of real Banach spaces.     

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.