article · Operations Research Forum
Abstract In this paper, we introduce an efficient algorithm for solving bilevel split variational monotone inclusion problems. The class of problems studied in this paper contains several other classes of well-known problems which have been studied by many authors. Unlike several existing methods in the literature, our method does not require the underlying operators in the lower-level problem and upper-level to be Lipschitz continuous. The proposed method is a combination of the Tseng method and the projection and contraction method. The convergence of our new algorithm is enhanced with double inertial steps. We obtain the strong convergence results of our algorithm under mild conditions on the control parameters of our method. Furthermore, we carry out some numerical tests to show the advantage of our new method over many well-known methods. Our results improve, generalize, and unify several existing results in the literature.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.1007/s43069-025-00566-2
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.