Two modified Tseng’s extragradient methods have been proposed to calculate the minimum-norm solutions of split variational inequality problems, providing proven strong convergence under specified mathematical conditions. In a peer-reviewed research study published in the Journal of Inequalities and Applications, authors Caini Xu and Dan Qiu developed these iterative algorithmic frameworks to resolve split variational inequality problems governed by pseudo-monotone, sequentially weakly continuous mappings.
The first algorithm proposed by the authors is designed for problem instances where the underlying mappings are Lipschitz continuous. For this operational setting, the researchers formulated a modified Tseng’s extragradient method equipped with a self-adaptive step size. Under the analytical conditions where the mappings are pseudo-monotone, sequentially weakly continuous, and Lipschitz continuous, the research proves that the sequence generated by this self-adaptive algorithm converges strongly to the minimum-norm solution.
When the mappings are uniformly continuous, Xu and Qiu introduced a modified Tseng's extragradient method with line search. The authors established a theoretical convergence proof showing that when the mappings are pseudo-monotone, sequentially weakly continuous, and uniformly continuous, the sequence produced by this line search algorithm also converges strongly to the minimum-norm solution.
To evaluate the practical efficacy of both modified extragradient algorithms, the authors presented numerical experiments demonstrating the performance of the proposed methods.
Subject of Research: Modified Tseng's extragradient methods for split variational inequality problems
Article Title: Modified Tseng’s extragradient methods for the minimum-norm solutions of the pseudo-monotone split variational inequality problems
Article References: Xu, C., & Qiu, D. (2026). Modified Tseng’s extragradient methods for the minimum-norm solutions of the pseudo-monotone split variational inequality problems. Journal of Inequalities and Applications. https://doi.org/10.1186/s13660-026-03544-2
Image Credits: AI Generated
DOI: 10.1186/s13660-026-03544-2
Keywords: Tseng's extragradient method, split variational inequality problem, minimum-norm solutions, pseudo-monotone mappings, Lipschitz continuous mappings, uniformly continuous mappings, sequentially weakly continuous mappings, self-adaptive step size, line search, strong convergence, numerical experiments, variational inequalities, iterative algorithms, convergence analysis, Caini Xu, Dan Qiu
Cite Scienmag News
Reid Dalton. (November 17, 2026). Modified Extragradient Algorithms Establish Strong Convergence for Split Variational Inequality Problems. Scienmag. https://scienmag.com/modified-extragradient-algorithms-establish-strong-convergence-for-split-variational-inequality-problems/
Reid Dalton. "Modified Extragradient Algorithms Establish Strong Convergence for Split Variational Inequality Problems." Scienmag, 17 November 2026, https://scienmag.com/modified-extragradient-algorithms-establish-strong-convergence-for-split-variational-inequality-problems/. Accessed 17 November 2026.
Reid Dalton. "Modified Extragradient Algorithms Establish Strong Convergence for Split Variational Inequality Problems." Scienmag. November 17, 2026. https://scienmag.com/modified-extragradient-algorithms-establish-strong-convergence-for-split-variational-inequality-problems/








