1 citations · 1 across the 6 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.OC2020
Gauss-Newton-type methods for bilevel optimization
Joerg Fliege, Andrey Tin, Alain Zemkoho
This article studies Gauss-Newton-type methods for over-determined systems to find solutions to bilevel programming problems. To proceed, we use the lower-level value function refo…
math.OC2020
A note on partial calmness for bilevel optimization problems with linearly structured lower level
Patrick Mehlitz, Leonid I. Minchenko, Alain B. Zemkoho
Partial calmness is a celebrated but restrictive property of bilevel optimization problems whose presence opens a way to the derivation of Karush--Kuhn--Tucker-type necessary optim…