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

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.

Authors

Institutions

Publication Details

Journal
Operations Research Forum
Published
2025-10-21
DOI
https://doi.org/10.1007/s43069-025-00566-2
Citations
1
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
1.50
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Rekha Panicker, Austine Efut Ofem, Ojen Kumar Narain, Godwin Chidi Ugwunnadi
1 citations
Operations Research Forum
Optimization and Variational Analysis
1.50
article

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

Rekha Panicker, Austine Efut Ofem, Ojen Kumar Narain, Godwin Chidi Ugwunnadi
article en
1 citations

Abstract

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.

Operations Research ForumVol. 6(4)
University of Eswatini (SZ), Sefako Makgatho Health Sciences University (ZA), Walter Sisulu University (ZA), University of KwaZulu-Natal (ZA)
Openalex Percentile: Top 12%
Optimization and Variational Analysis
1.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Twice Extrapolated Algorithm for Solving Non-Lipschitz Bilevel Split Monotone Variational Inclusion Problem — Rekha Panicker, Austine Efut Ofem, et al. · Operations Research Forum (2025) | TGRS Research Map | TGRS