Abstract In this paper, we propose two algorithms for finding the solution of a bilevel equilibrium problem in a real Hilbert space. Under some sufficient assumptions on the bifunctions involving pseudomonotone and Lipschitz-type conditions, we obtain the strong convergence of the iterative sequence generated by the first algorithm. Furthermore, the strong convergence of the sequence generated by the second algorithm is obtained without a Lipschitz-type condition
We consider bilevel pseudomonotone equilibrium problems. We use a penalty function to convert a bile...
In this paper we propose a splitting subgradient algorithm for solving equilibrium problems involvin...
In this paper, new numerical algorithms are introduced for finding the solution of a variational ine...
In this paper, we introduce an inertial proximal method for solving a bilevel problem involving two ...
The paper introduces an inertial extragradient subgradient method with self-adaptive step sizes for ...
Abstract In a real Hilbert space, let GSVI and CFPP represent a general system of variational inequa...
In this paper we introduce a class of numerical methods for solving an equilibrium problem. This cla...
The main focus of this paper is on bilevel optimization on Hilbert spaces involving two monotone equ...
We propose a new strongly convergent algorithm for finding a common point in the solution set of a c...
Abstract We use the notion of Halpern-type sequence recently introduced by the present authors to co...
Abstract In this paper, we propose new methods for finding a common solution to pseudomonotone and L...
The paper introduces and analysizes the convergence of two multi-step proximal-like algorithms for p...
This paper presents two inertial extragradient algorithms for finding a solution of split pseudomono...
In this paper, we introduce a new hybrid extragradient iteration method for finding a common element...
A plethora of applications from mathematical programming, such as minimax, and mathematical programm...
We consider bilevel pseudomonotone equilibrium problems. We use a penalty function to convert a bile...
In this paper we propose a splitting subgradient algorithm for solving equilibrium problems involvin...
In this paper, new numerical algorithms are introduced for finding the solution of a variational ine...
In this paper, we introduce an inertial proximal method for solving a bilevel problem involving two ...
The paper introduces an inertial extragradient subgradient method with self-adaptive step sizes for ...
Abstract In a real Hilbert space, let GSVI and CFPP represent a general system of variational inequa...
In this paper we introduce a class of numerical methods for solving an equilibrium problem. This cla...
The main focus of this paper is on bilevel optimization on Hilbert spaces involving two monotone equ...
We propose a new strongly convergent algorithm for finding a common point in the solution set of a c...
Abstract We use the notion of Halpern-type sequence recently introduced by the present authors to co...
Abstract In this paper, we propose new methods for finding a common solution to pseudomonotone and L...
The paper introduces and analysizes the convergence of two multi-step proximal-like algorithms for p...
This paper presents two inertial extragradient algorithms for finding a solution of split pseudomono...
In this paper, we introduce a new hybrid extragradient iteration method for finding a common element...
A plethora of applications from mathematical programming, such as minimax, and mathematical programm...
We consider bilevel pseudomonotone equilibrium problems. We use a penalty function to convert a bile...
In this paper we propose a splitting subgradient algorithm for solving equilibrium problems involvin...
In this paper, new numerical algorithms are introduced for finding the solution of a variational ine...