The Augmented Weak Sharpness of Solution Sets in Equilibrium Problems

The present paper first provides sufficient conditions and characterizations for linearly conditioned bifunction associated with an equilibrium problem. It then introduces the notion of weak sharp solution for equilibrium problems which is analogous to the linear conditioning notion. This new notion generalizes and unifies the notion of weak sharp minima for optimization problems as well as the notion of weak sharp solutions for variational inequality problems. Some sufficient conditions and characterizations of weak sharpness are also presented. Finally, we study the finite convergence property of sequences generated by some algorithms for solving equilibrium problems under linear conditioning and weak shapness assumptions. An upper bound of the number of iterations by which the sequence generated by proximal point algorithm converges to a solution of equilibrium problems is also given.

This paper deals with the study of weak sharp solutions for nonsmooth variational inequalities and finite convergence property of the proximal point method. We present several characterizations for weak sharpness of the solutions set of nonsmooth variational inequalities without using the gap functions. We show that under weak sharpness of the solutions set, the sequence generated by proximal point methods terminates after a finite number of iterations. We also give an upper bound for the number of iterations for which the sequence generated by the exact proximal point methods terminates.

We first introduce the notion of weak sharpness for the solution sets of variational inequality problems (in short, VIP) on Hadamard spaces. We then study the finite convergence property of sequences generated by the inexact proximal point algorithm with different error terms for solving VIP under weak sharpness of the solution set. We also give an upper bound on the number of iterations by which the sequence generated by the exact proximal point algorithm converges to a solution of VIP. An example is also given to illustrate our results.

Strong convergence theorems for countable families of asymptotically relatively nonexpansive mappings with applications

Strong convergence theorem by hybrid method for equilibrium problems, variational inequality problems and maximal monotone operators

We introduce a hybrid method for finding a common element in the solutions set of an equilibrium problem and the common fixed points set of a countable family of relatively quasi-nonexpansive mappings in a Banach space. A strong convergence theorem of the proposed method is established by using the concept of the Mosco convergence when the family {T n } satisfies the (*)-condition. The examples of three generated mappings which satisfy the (*)-condition are also given. Using the obtained result, we give some applications concerning the variational inequality problem and the convex minimization problem.

Well-posed equilibrium problems

In this paper, we first study a hierarchical problem of Baillon’s type, and we study a strong convergence theorem of this problem. For the special case of this convergence theorem, we obtain a strong convergence theorem for the ergodic theorem of Baillon’s type. Our result of the ergodic theorem of Baillon’s type improves and generalizes many existence theorems of this type of problem. Two numerical examples are given to demonstrate our results. As applications of our convergence theorem of the hierarchical problem, we study the unique solution for the following problems: mathematical programming with multiply sets split variational inclusion and fixed point set constraints; mathematical programming with multiple sets split variational inequalities and fixed point set constraints; the variational inequality problem with a system of mixed type equilibria and fixed point set constraints; the variational inequality problem with multiple sets split system of mixed type equilibria and fixed point set constraints; mathematical programming with a system of mixed type equilibria and fixed point set constraints. We give iteration processes for these types of problems and establish the strong convergence for the unique solution of these problems. For our special case, our results can be reduced to the following problems: the unique minimal norm solution of the multiply sets split monotonic variational inclusion problems; the minimum norm solutions for the multiple sets split system of mixed type equilibria problem; the minimum norm solution of the system of mixed type equilibria problem. Our results will have many applications in diverse fields of science.

Hybrid iterative scheme by a relaxed extragradient method for solutions of equilibrium problems and a general system of variational inequalities with application to optimization

A new hybrid method for solving a generalized equilibrium problem, solving a variational inequality problem and obtaining common fixed points in Banach spaces, with applications

New iterative scheme with nonexpansive mappings for equilibrium problems and variational inequality problems in Hilbert spaces

Solutions of system of equilibrium and variational inequality problems on fixed points of infinite family of nonexpansive mappings

A hybrid extragradient method for approximating the common solutions of a variational inequality, a system of variational inequalities, a mixed equilibrium problem and a fixed point problem

In this paper, we introduce a new algorithm for finding a common element of the set of fixed points of N strict pseudocontractions and the set of solutions of equilibrium problems with a pseudomonotone and Lipschitz-type continuous bifunction. The scheme is motivated by the idea of extragradient methods and fixed point iteration methods. We show that the iterative sequences generated by this algorithm converge strongly to the above mentioned common element under some suitable conditions on algorithm parameters in a real Hilbert space. And also, we consider the variational inequality problems as an application. MSC: 46H09; 47H10; 47J25; 65K10

In this article, we consider an inclusion problem which is defined by means of a sum of a single-valued vector field and a set-valued vector field defined on a Hadamard manifold. We propose Halpern-type and Mann-type algorithms for finding a common point of the set of fixed points of a nonexpansive mapping and the set of solutions of the inclusion problem defined on a Hadamard manifold. Some particular cases of our problem and algorithm are also discussed. We study the convergence of the proposed algorithm to a common point of the set of fixed points of a nonexpansive mapping and the set of solutions of the inclusion problem defined on a Hadamard manifold. As applications of our results and algorithms, we derive the solution methods and their convergence results for the optimization problems, variational inequality problems and equilibrium problems in the setting of Hadamard manifolds.