An accelerated subgradient extragradient algorithm for solving bilevel variational inequality problems involving non-Lipschitz operator

• Published in: Communications in nonlinear science & numerical simulation Vol. 127; p. 107549
• Main Authors: Peng, Zai-Yun, Li, Dan, Zhao, Yong, Liang, Ren-Li
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.12.2023
• Subjects: Bilevel variational inequality problems; Non-Lipschitz continuous; Subgradient extragradient algorithm; 47J30; 65K15; 47J20; 68W10; Subgradient extragradient algorithm; Non-Lipschitz continuous; 47J25; Bilevel variational inequality problems
• ISSN: 1007-5704; 1878-7274
• DOI: 10.1016/j.cnsns.2023.107549

In this paper, an accelerated subgradient extragradient algorithm with a new non-monotonic step size is proposed to solve bilevel variational inequality problems involving non-Lipschitz continuous operator in Hilbert spaces. The proposed algorithm with a new non-monotonic step size has the advantage of requiring only one projection onto the feasible set during each iteration and does not require prior knowledge of the Lipschitz constant of the mapping involved. Under suitable and weaker conditions, the proposed algorithm achieves strong convergence. Some numerical tests are provided to demonstrate the efficiency and advantages of the proposed algorithm against existing related algorithms. •We studied the variational inequality problem with a variational inequality constraint (BVIP).•The proposed Algorithm 3.1 uses a new non-monotonic step size criteria.•The strong convergence theorem of the proposed algorithm is established under weaker conditions.•Numerical simulation examples are given to show the application and the benefits of algorithm.