학술논문
Inexact Restoration Methods for Semivectorial Bilevel Programming Problem on Riemannian Manifolds
Document Type
article
Author
Source
Axioms, Vol 11, Iss 12, p 696 (2022)
Subject
Language
English
ISSN
2075-1680
Abstract
For a better understanding of the bilevel programming on Riemannian manifolds, a semivectorial bilevel programming scheme is proposed in this paper. The semivectorial bilevel programming is firstly transformed into a single-level programming problem by using the Karush–Kuhn–Tucker (KKT) conditions of the lower-level problem, which is convex and satisfies the Slater constraint qualification. Then, the single-level programming is divided into two stages: restoration and minimization, based on which an Inexact Restoration algorithm is developed. Under certain conditions, the stability and convergence of the algorithm are analyzed.