• Korean Journal of Mathematics
• /
• 제23권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.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.819-827
• /
• 2009

In this paper, we introduce new pseudomonotonicity and proper quasimonotonicity with respect to a given function, and show some existence results for strong implicit vector variational inequalities by considering new generalized Minty's lemma. Our results generalize and extend some results in [1].

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제15권4호
• /
• pp.423-432
• /
• 2008

In this paper, we consider a new Minty's Lemma for strong implicit vector variational inequality systems and obtain some existence results for systems of strong implicit vector variational inequalities which generalize some results in [1].

• 대한수학회논문집
• /
• 제21권4호
• /
• pp.665-673
• /
• 2006

In a recent paper, Domokos and $Kolumb\'{a}}n$ [2] gave an interesting interpretation of variational inequalities (VI) and vector variational inequalities (VVI) in Banach space settings in terms of variational inequalities with operator solutions (in short, OVVI). Inspired by their work, in a former paper [4], we proposed the scheme of generalized vector variational inequality with operator solutions (in short, GOVVI) which extends (OVVI) into a multivalued case. In this note, we further develop the previous work [4]. A more general pseudomonotone operator is treated. We present a result on the existence of solutions of (GVVI) under the weak pseudomonotonicity introduced in Yu and Yao [8] within the framework of (GOVVI) by exploiting some techniques on (GOVVI) or (GVVI) in [4].

• 대한수학회보
• /
• 제50권3호
• /
• pp.823-832
• /
• 2013

We present a new algorithm for solving a system of nonlinear equations with convex constraints which combines proximal point and projection methodologies. Compared with the existing projection methods for solving the problem, we use a different system of linear equations to obtain the proximal point; and moreover, at the step of getting next iterate, our projection way and projection region are also different. Based on the Armijo-type line search procedure, a new hyperplane is introduced. Using the separate property of hyperplane, the new algorithm is proved to be globally convergent under much weaker assumptions than monotone or more generally pseudomonotone. We study the convergence rate of the iterative sequence under very mild error bound conditions.

• 대한수학회논문집
• /
• 제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
• /
• 제27권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.

• 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.