Search

In this paper, we revisit the subgradient extragradient method for solving a pseudomonotone variational inequality problem with the Lipschitz condition in real Hilbert spaces. A new algorithm based on the subgradient extragradient method with the technique of choosing a new step size is proposed. The weak convergence of the proposed algorithm is established under the pseudomonotonicity and the Lipschitz continuity as well as without using the sequentially weakly continuity of the variational inequality mapping and the nonasymptotic O (1 / n) convergence rate of the proposed algorithm is presented, while the strong convergence theorem of the proposed algorithm is also proved under the strong pseudomonotonicity and the Lipschitz continuity hypotheses. In order to show the computational effectiveness of our algorithm, some numerical results are provided. [ABSTRACT FROM AUTHOR]

The purpose of this work is to develop a new version of the extragradient method for solving non-Lipschitzian and pseudo-monotone variational inequalities in real Hilbert spaces. First, we prove a sufficient condition for weak convergence of a proposed algorithm under relaxed assumptions. Next, under strong pseudomonotonicity and Lipschitz continuity assumptions, we obtain also a Q-linear convergence rate of this algorithm. Our results improve some recent contributions in the literature on the extragradient method. [ABSTRACT FROM AUTHOR]

The purpose of this work to investigate pseudomonotone and Lipschitz continuous variational inequalities in real Hilbert spaces. For solving this problem, we propose two new methods which combine advantages of the subgradient extragradient method and the projection contraction method. Similar to some recent developments, the proposed methods do not require the knowledge of the Lipschitz constant associated with the variational inequality mapping. Under suitable mild conditions, we establish the weak and strong convergence of the proposed algorithms. Moreover, linear convergence is obtained under strong pseudomonotonicity and Lipschitz continuity assumptions. Numerical examples in fractional programming and optimal control problems demonstrate the potential of our algorithms as well as compare their performances to several related results. [ABSTRACT FROM AUTHOR]

In this paper, we introduce several new extragradient-like approximation methods for solving variational inequalities in Hilbert spaces. Our algorithms are based on Tseng's extragradient method, subgradient extragradient method, inertial method, hybrid projection method and shrinking projection method. Strong convergence theorems are established under appropriate conditions. Our results extend and improve some related results in the literature. In addition, the efficiency of our algorithms is shown through numerical examples which are defined by the hybrid projection methods. [ABSTRACT FROM AUTHOR]

The subgradient extragradient method can be considered as an improvement of the extragradient method for variational inequality problems for the class of monotone and Lipschitz continuous mappings. In this paper, we propose two new algorithms as combination between the subgradient extragradient method and Mann-like method for finding a common element of the solution set of a variational inequality and the fixed point set of a demicontractive mapping. [ABSTRACT FROM AUTHOR]

The article discusses the solutions of mean value theorem for integral proposed by Duong Viet Thong of National Economics University in Hanoi City, Vietnam and Eugene Herman of Grinnell College in Grinnell, Iowa. It says that q(x) does not change sign if b = 0 or the zero is not in the continuously differentiable function. It mentions that g decreases on both (-3/2, ∞) and (-∞, -3/2) if y0 - 6y1 + 6y2 > 0.