期刊
OPTIMIZATION
卷 68, 期 8, 页码 1471-1489出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/02331934.2019.1581192
关键词
Bilevel optimization; Karush-Kuhn-Tucker transformation; mathematical program with complementarity constraints
Using the Karush-Kuhn-Tucker conditions for the convex lower level problem, the bilevel optimization problem is transformed into a single-level optimization problem (a mathematical program with complementarity constraints). A regularization approach for the latter problem is formulated which can be used to solve the bilevel optimization problem. This is verified if global or local optimal solutions of the auxiliary problems are computed. Stationary solutions of the auxiliary problems converge to C-stationary solutions of the mathematical program with complementarity constraints.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据