• The Pure and Applied Mathematics
• /
• v.19 no.3
• /
• pp.281-288
• /
• 2012

In this paper, the author defines a new generalized ${\eta}$, ${\delta}$, ${\alpha}$)-pseudomonotone mapping and considers the equivalence of Stampacchia-type vector variational-like inequality problems and Minty-type vector variational-like inequality problems for generalized (${\eta}$, ${\delta}$, ${\alpha}$)-pseudomonotone mappings in Banach spaces, called the generalized vector Minty's lemma.

• Kyungpook Mathematical Journal
• /
• v.59 no.1
• /
• pp.83-99
• /
• 2019

In this paper, we introduce a hybrid subgradient method for finding an element common to both the solution set of a class of pseudomonotone equilibrium problems, and the set of fixed points of a finite family of ${\kappa}$-strictly presudononspreading mappings in a real Hilbert space. We establish some weak and strong convergence theorems of the sequences generated by our iterative method under some suitable conditions. These convergence theorems are investigated without the Lipschitz condition for bifunctions. Our results complement many known recent results in the literature.

• Journal of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.595-619
• /
• 2022

The purpose of this paper is to introduce an iterative algorithm for approximating a solution of split equality variational inequality problem for pseudomonotone mappings in the setting of Banach spaces. Under certain conditions, we prove a strong convergence theorem for the iterative scheme produced by the method in real reflexive Banach spaces. The assumption that the mappings are uniformly continuous and sequentially weakly continuous on bounded subsets of Banach spaces are dispensed with. In addition, we present an application of our main results to find solutions of split equality minimum point problems for convex functions in real reflexive Banach spaces. Finally, we provide a numerical example which supports our main result. Our results improve and generalize many of the results in the literature.

• Kyungpook Mathematical Journal
• /
• v.64 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.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].

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.1
• /
• pp.135-173
• /
• 2023

The purpose of this paper is to introduce and study a method for solving the split equality of variational inequality and f, g-fixed point problems in reflexive real Banach spaces, where the variational inequality problems are for uniformly continuous pseudomonotone mappings and the fixed point problems are for Bregman relatively f, g-nonexpansive mappings. A strong convergence theorem is proved under some mild conditions. Finally, a numerical example is provided to demonstrate the effectiveness of the algorithm.

• Korean Journal of Mathematics
• /
• v.23 no.3
• /
• pp.457-478
• /
• 2015

In this paper we propose an iteration hybrid method for approximating a point in the intersection of the solution-sets of pseudomonotone equilibrium and variational inequality problems and the fixed points of a semigroup-nonexpensive mappings in Hilbert spaces. The method is a combination of projection, extragradient-Armijo algorithms and Manns method. We obtain a strong convergence for the sequences generated by the proposed method.

• Nonlinear Functional Analysis and Applications
• /
• v.29 no.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.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.1
• /
• pp.1-22
• /
• 2022

The purpose of this research is to formulate a new proximal-type algorithm to solve the equilibrium problem in a real Hilbert space. A new algorithm is analogous to the famous two-step extragradient algorithm that was used to solve variational inequalities in the Hilbert spaces previously. The proposed iterative scheme uses a new step size rule based on local bifunction details instead of Lipschitz constants or any line search scheme. The strong convergence theorem for the proposed algorithm is well-proven by letting mild assumptions about the bifunction. Applications of these results are presented to solve the fixed point problems and the variational inequality problems. Finally, we discuss two test problems and computational performance is explicating to show the efficiency and effectiveness of the proposed algorithm.