Skip to main navigation Skip to search Skip to main content

A Twice Extrapolated Algorithm for Solving Non-Lipschitz Bilevel Split Monotone Variational Inclusion Problem

  • Austine Efut Ofem*
  • , Godwin Chidi Ugwunnadi
  • , Rekha Panicker
  • , Ojen Kumar Narain
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

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.

Original languageEnglish
Article number158
JournalOperations Research Forum
Volume6
Issue number4
DOIs
Publication statusPublished - Dec 2025
Externally publishedYes

Keywords

  • Bilevel split monotone variational inclusion problem
  • Inertial
  • Projection and contraction method
  • Strongly monotone operators
  • Tseng’s method

Fingerprint

Dive into the research topics of 'A Twice Extrapolated Algorithm for Solving Non-Lipschitz Bilevel Split Monotone Variational Inclusion Problem'. Together they form a unique fingerprint.

Cite this