• 대한수학회논문집
• /
• 제31권4호
• /
• pp.879-893
• /
• 2016

In this paper, we introduce three subgradient extragradient algorithms for solving pseudomonotone equilibrium problems. The paper originates from the subgradient extragradient algorithm for variational inequalities and the extragradient method for pseudomonotone equilibrium problems in which we have to solve two optimization programs onto feasible set. The main idea of the proposed algorithms is that at every iterative step, we have replaced the second optimization program by that one on a specific half-space which can be performed more easily. The weakly and strongly convergent theorems are established under widely used assumptions for bifunctions.

• 대한수학회보
• /
• 제47권4호
• /
• pp.675-685
• /
• 2010

In this paper, we consider a new class of regularized (nonconvex) generalized mixed variational inequality problems in real Hilbert space. We give the concepts of partially relaxed strongly mixed monotone and partially relaxed strongly $\theta$-pseudomonotone mappings, which are extension of the concepts given by Xia and Ding [19], Noor [13] and Kazmi et al. [9]. Further we use the auxiliary principle technique to suggest a two-step iterative algorithm for solving regularized (nonconvex) generalized mixed variational inequality problem. We prove that the convergence of the iterative algorithm requires only the continuity, partially relaxed strongly mixed monotonicity and partially relaxed strongly $\theta$-pseudomonotonicity. The theorems presented in this paper represent improvement and generalization of the previously known results for solving equilibrium problems and variational inequality problems involving the nonconvex (convex) sets, see for example Noor [13], Pang et al. [14], and Xia and Ding [19].

• Journal of applied mathematics & informatics
• /
• 제29권5_6호
• /
• pp.1179-1191
• /
• 2011

In this paper, we introduce a new iterative scheme for finding a common element of the set of fixed points of a finite family of strict pseudocontractions and the solution set of pseudomonotone and Lipschitz-type continuous equilibrium problems. The scheme is based on the idea of extragradient methods and fixed point iteration methods. We show that the iterative sequences generated by this algorithm converge strongly to the common element in a real Hilbert space.

• 대한수학회보
• /
• 제59권4호
• /
• pp.1019-1044
• /
• 2022

In this paper, we propose new algorithms for solving equilibrium and multivalued variational inequality problems in a real Hilbert space. The first algorithm for equilibrium problems uses only one approximate projection at each iteration to generate an iteration sequence converging strongly to a solution of the problem underlining the bifunction is pseudomonotone. On the basis of the proposed algorithm for the equilibrium problems, we introduce a new algorithm for solving multivalued variational inequality problems. Some fundamental experiments are given to illustrate our algorithms as well as to compare them with other algorithms.

• Kyungpook Mathematical Journal
• /
• 제64권1호
• /
• pp.69-94
• /
• 2024

In this paper, we introduce an inertial self-adaptive projection method using Bregman distance techniques for solving pseudomonotone equilibrium problems in reflexive Banach spaces. The algorithm requires only one projection onto the feasible set without any Lipschitz-like condition on the bifunction. Using this method, a strong convergence theorem is proved under some mild conditions. Furthermore, we include numerical experiments to illustrate the behaviour of the new algorithm with respect to the Bregman function and other algorithms in the literature.

• 대한수학회논문집
• /
• 제32권4호
• /
• pp.933-957
• /
• 2017

In this paper, we prove some existence results of solutions for a new class of generalized bi-quasi-variational-like inequalities (GBQVLI) for (${\eta}-h$)-quasi-pseudo-monotone type I and strongly (${\eta}-h$)-quasi-pseudo-monotone type I operators defined on non-compact sets in locally convex Hausdorff topological vector spaces. To obtain our results on GBQVLI for (${\eta}-h$)-quasi-pseudo-monotone type I and strongly (${\eta}-h$)-quasi-pseudo-monotone type I operators, we use Chowdhury and Tan's generalized version of Ky Fan's minimax inequality as the main tool.

• Nonlinear Functional Analysis and Applications
• /
• 제29권2호
• /
• pp.307-332
• /
• 2024

Two inertial extragradient-type algorithms are introduced for solving convex pseudomonotone variational inequalities with fixed point problems, where the associated mapping for the fixed point is a 𝜌-demicontractive mapping. The algorithm employs variable step sizes that are updated at each iteration, based on certain previous iterates. One notable advantage of these algorithms is their ability to operate without prior knowledge of Lipschitz-type constants and without necessitating any line search procedures. The iterative sequence constructed demonstrates strong convergence to the common solution of the variational inequality and fixed point problem under standard assumptions. In-depth numerical applications are conducted to illustrate theoretical findings and to compare the proposed algorithms with existing approaches.