Optimality conditions for bilevel programmes via Moreau envelope reformulation*

IF 1.6 3区数学 Q2 MATHEMATICS, APPLIED

Optimization Pub Date : 2024-05-27 DOI:10.1080/02331934.2024.2358086

Kuang Bai, Jane J. Ye, Shangzhi Zeng

引用次数: 0

Abstract

For bilevel programmes with a convex lower-level programme, the classical approach replaces the lower-level programme with its Karush-Kuhn-Tucker condition and solve the resulting mathematical prog...

查看原文本刊更多论文

通过莫罗包络重构实现双层方案的最优化条件*

对于具有下层凸方案的双层方案，经典方法是将下层方案替换为其 Karush-Kuhn-Tucker 条件，然后求解得到的数学方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Optimization 数学-应用数学

CiteScore

4.50

自引率

9.10%

发文量

146

审稿时长

4.5 months

期刊介绍： Optimization publishes refereed, theoretical and applied papers on the latest developments in fields such as linear, nonlinear, stochastic, parametric, discrete and dynamic programming, control theory and game theory. A special section is devoted to review papers on theory and methods in interesting areas of mathematical programming and optimization techniques. The journal also publishes conference proceedings, book reviews and announcements. All published research articles in this journal have undergone rigorous peer review, based on initial editor screening and anonymous refereeing by independent expert referees.