A SELF-ADAPTIVE ITERATIVE ALGORITHM FOR SOLVING A CLASS  OF BILEVEL SPLIT VARIATIONAL INEQUALITY PROBLEM  IN HILBERT SPACES

Chu Thị Ngân; Nguyễn Tất Thắng

doi:10.34238/tnu-jst.8348

A SELF-ADAPTIVE ITERATIVE ALGORITHM FOR SOLVING A CLASS OF BILEVEL SPLIT VARIATIONAL INEQUALITY PROBLEM IN HILBERT SPACES

About this article

Received: 17/07/23 Revised: 22/08/23 Published: 22/08/23

Authors

1. Chu Thi Ngan , School of Applied Mathematics and Informatics - Hanoi University of Science and Technology
2. Nguyen Tat Thang, Thai Nguyen University

Abstract

The aim of this paper is to examine a complex bilevel problem of ﬁnding solutions to multiple sets of variational inequalities in Hilbert spaces. This problem is challenging and requires an effective solution method. We propose a self-adaptive algorithm that dynamically adjusts the step sizes based on the information from the previous step. We rigorously prove the strong convergence of our algorithm and demonstrate that it requires less restrictive conditions than the ones used by Censor et al. (2012). We apply our main results to solve an important problem: the split variational inequality problem. Our analysis shows that our algorithm converges strongly with weaker assumptions than those used recently by Censor et al. (2012) and Buong (2017). To further illustrate the convergence behavior of our method, we provide some numerical examples that demonstrate its effectiveness and efﬁciency.

Keywords

Split feasibility problem; Variational inequality; Hilbert spaces; Non-expanding mapping; Metric projection

Full Text:

PDF

References

[1] Y. Censor, A. Gibali, and S. Reich, “Algorithms for the split variational inequality problem,”
Algorithms Number., vol. 59, pp. 301–323, 2012.
[2] G. Stampacchia, “Formes bilineaires´ coercitives sur les ensembles convexes,” C. R. Acad. Sci. Paris, vol. 258, pp. 4413 - 4416, 1964.
[3] P.E. Mainge,´ “Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization,” Set-Valued Anal, vol. 16, pp. 899—912, 2008.
[4] Y. Censor, T. Elfving, N. Kopf, and T. Bortfeld, “The multiple-sets split feasibility problem and its applica-tions for inverse problems,” Inverse Probl., vol. 21, pp. 2071 - 2084, 2005.
[5] Y. Censor and T. Elfving, “A multiprojection algorithm using Bregman projections in a product space,” Numer. Algorithms, vol. 8, pp. 221-239, 1994.
[6] Y. Censor, T. Bortfeld, B. Martin, and A. Trofiov, “A unifid approach for inverse problems in intensity modulated radiation therapy,” Phys. Med. Biol, vol. 51, pp. 2353–2365, 2006.
[7] C. Byrne, “Iterative oblique projections onto convex subsets and the split feasibility problem,” Inverse Probl, vol. 18, pp. 441-453, 2002.
[8] C. Byrne, “A unifid treatment of some iterative methods in signal processing and image reconstruction,” Inverse Probl, vol. 20, pp. 103-120, 2004.
[9] K. Goebel and W. A. Kirk, “Topics in Metric Fixed Point Theory,” Cambridge Stud. Adv. Math 28. Cam- bridge: Cambridge University Press. 1990.
[10] Z. Opial, “Weak convergence of the sequence of successive approximations for nonexpansive mappings,” Bull. Am. Math. Soc., vol. 73, pp. 591—597, 1976.
[11] R. W. Cottle and J. C. Yao, “Pseudo-monotone complementarity problems in Hilbert space,” J.Optim. Theory Appl., vol. 75, pp. 281—295, 1992.
[12] P. E. Mainge,´ “Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization,” Set-Valued Anal., vol.16, pp. 899-912, 2008

DOI: https://doi.org/10.34238/tnu-jst.8348

Refbacks

There are currently no refbacks.



Remember me