Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bai, Kuang, Ye, Jane, Zeng, Shangzhi
Format: Preprint
Veröffentlicht: 2023
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2311.14857
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910362480148480
author Bai, Kuang
Ye, Jane
Zeng, Shangzhi
author_facet Bai, Kuang
Ye, Jane
Zeng, Shangzhi
contents For bilevel programs with a convex lower level program, the classical approach replaces the lower level program with its Karush-Kuhn-Tucker condition and solve the resulting mathematical program with complementarity constraint (MPCC). It is known that when the set of lower level multipliers is not unique, MPCC may not be equivalent to the original bilevel problem, and many MPCC-tailored constraint qualifications do not hold. In this paper, we study bilevel programs where the lower level is generalized convex. Applying the equivalent reformulation via Moreau envelope, we derive new directional optimality conditions. Even in the nondirectional case, the new optimality condition is stronger than the strong stationarity for the corresponding MPCC.
format Preprint
id arxiv_https___arxiv_org_abs_2311_14857
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Optimality conditions for bilevel programs via Moreau envelope reformulation
Bai, Kuang
Ye, Jane
Zeng, Shangzhi
Optimization and Control
For bilevel programs with a convex lower level program, the classical approach replaces the lower level program with its Karush-Kuhn-Tucker condition and solve the resulting mathematical program with complementarity constraint (MPCC). It is known that when the set of lower level multipliers is not unique, MPCC may not be equivalent to the original bilevel problem, and many MPCC-tailored constraint qualifications do not hold. In this paper, we study bilevel programs where the lower level is generalized convex. Applying the equivalent reformulation via Moreau envelope, we derive new directional optimality conditions. Even in the nondirectional case, the new optimality condition is stronger than the strong stationarity for the corresponding MPCC.
title Optimality conditions for bilevel programs via Moreau envelope reformulation
topic Optimization and Control
url https://arxiv.org/abs/2311.14857