A Self-adaptive Algorithm with Multi-step Inertia for Solving Convex Bilevel Optimization Problems
preprint
OA: closed
Abstract
In this paper, we propose an adaptive algorithm with multi-step inertia for solving a convex bilevel optimization problem. Under suitable parameter conditions, we prove that our algorithm converges strongly to some solution of the problem, which is the unique solution of some variational inequality problem. The effectiveness of the proposed algorithm is verified by numerical experiments and compared with other algorithms. 2010 Mathematics Subject Classification 47H09, 47H10, 65K10, 90C25.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00