arXiv Analytics

Sign in

arXiv:2003.06138 [math.OC]AbstractReferencesReviewsResources

A note on partial calmness for bilevel optimization problems with linear structures at the lower level

Patrick Mehlitz, Leonid I. Minchenko, Alain B. Zemkoho

Published 2020-03-13Version 1

Partial calmness is a celebrated but restrictive property of bilevel optimization problems whose presence opens a way to the derivation of KKT-type necessary optimality conditions in order to characterize local minimizers. In the past, suffcient conditions for the validity of partial calmness have been investigated. In this regard, the presence of linear structures at the lower level problem has turned out to be beneffcial. However, the associated literature suffers from inaccurate results. In this note, we clarify some regarding erroneous statements and visualize the underlying issues with the aid of illustrative counterexamples.

Related articles: Most relevant | Search more
arXiv:2307.09924 [math.OC] (Published 2023-07-19)
Inexact Direct-Search Methods for Bilevel Optimization Problems
arXiv:2307.11427 [math.OC] (Published 2023-07-21)
Second-order optimality conditions for bilevel programs
arXiv:1608.03260 [math.OC] (Published 2016-08-10)
Duality Approach to Bilevel Programs with a Convex Lower Level