A General Inertial Projection-Type Algorithm for Solving Equilibrium Problem in Hilbert Spaces with Applications in Fixed-Point Problems

A plethora of applications from mathematical programming, such as minimax, and mathematical programming, penalization, fixed point to mention a few can be framed as equilibrium problems. Most of the techniques for solving such problems involve iterative methods that is why, in this paper, we introduced a new extragradient-like method to solve equilibrium problems in real Hilbert spaces with a Lipschitz-type condition on a bifunction. The advantage of a method is a variable stepsize formula that is updated on each iteration based on the previous iterations. The method also operates without the previous information of the Lipschitz-type constants. The weak convergence of the method is established by taking mild conditions on a bifunction. For application, fixed-point theorems that involve strict pseudocontraction and results for pseudomonotone variational inequalities are studied. We have reported various numerical results to show the numerical behaviour of the proposed method and correlate it with existing ones.

Hybrid Algorithms for Variational Inequalities Involving a Strict Pseudocontraction

In a real Hilbert space, we investigate the Tseng’s extragradient algorithms with hybrid adaptive step-sizes for treating a Lipschitzian pseudomonotone variational inequality problem and a strict pseudocontraction fixed-point problem, which are symmetry. By imposing some appropriate weak assumptions on parameters, we obtain a norm solution of the problems, which solves a certain hierarchical variational inequality.

Hybrid Bregman projection methods for fixed point and equilibrium problems

The purpose of this article is to investigate a projection algorithm for solving a fixed point problem of a closed multi-valued Bregman quasi-strict pseudocontraction and an equilibrium problem of a bifunction. Strong convergence of the projection algorithm is obtained without any compact assumption in a reflexive Banach space. As applications, monotone variational inequality problems are considered. Finally, a numerical simulation example is presented for demonstrating the feasibility and convergence of the algorithm proposed in main result.

A Hybrid Subgradient Algorithm for Finding a Common Solution of an Equilibrium Problem and a Family of Strict Pseudocontraction Mappings

We propose a new strongly convergent algorithm for finding a common point in the solution set of a class of pseudomonotone equilibrium problems and the set of common fixed points of a family of strict pseudocontraction mappings in a real Hilbert space. The strong convergence theorem of proposed algorithms is investigated without the Lipschitz condition for the bifunctions. Our results complement many known recent results in the literature.

Existence and Convergence Theorems by an Iterative Shrinking Projection Method of a Strict Pseudocontraction in Hilbert Spaces

The aim of this paper is to provide some existence theorems of a strict pseudocontraction by the way of a hybrid shrinking projection method, involving some necessary and sufficient conditions. The method allows us to obtain a strong convergence iteration for finding some fixed points of a strict pseudocontraction in the framework of real Hilbert spaces. In addition, we also provide certain applications of the main theorems to confirm the existence of the zeros of an inverse strongly monotone operator along with its convergent results.

Relaxed Viscosity Approximation Methods with Regularization for Constrained Minimization Problems

We introduce a new relaxed viscosity approximation method with regularization and prove the strong convergence of the method to a common fixed point of finitely many nonexpansive mappings and a strict pseudocontraction that also solves a convex minimization problem and a suitable equilibrium problem.

A New General System of Generalized Nonlinear Mixed Composite-Type Equilibria and Fixed Point Problems with an Application to Minimization Problems

We introduce a new general system of generalized nonlinear mixed composite-type equilibria and propose a new iterative scheme for finding a common element of the set of solutions of a generalized equilibrium problem, the set of solutions of a general system of generalized nonlinear mixed composite-type equilibria, and the set of fixed points of a countable family of strict pseudocontraction mappings. Furthermore, we prove the strong convergence theorem of the purposed iterative scheme in a real Hilbert space. As applications, we apply our results to solve a certain minimization problem related to a strongly positive bounded linear operator. Finally, we also give a numerical example which supports our results. The results obtained in this paper extend the recent ones announced by many others.