KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization

For a long time, the bilevel programming problem has essentially been considered as a special case of mathematical programs with equilibrium constraints, in particular when the so-called KKT reformulation is in question. Recently though, this widespread believe was shown to be false in general. In this paper, other aspects of the difference between both problems are revealed as we consider the KKT approach for the nonsmooth bilevel program. It turns out that the new inclusion (constraint) which appears as a consequence of the partial subdifferential of the lower-level Lagrangian (PSLLL) places the KKT reformulation of the nonsmooth bilevel program in a new class of mathematical program with both set-valued and complementarity constraints. While highlighting some new features of this problem, we attempt here to establish close links with the standard optimistic bilevel program. Moreover, we discuss possible natural extensions for C-, M-, and S-stationarity concepts. Most of the results rely on a coderivati...

[1]  Bastian Goldlücke,et al.  Variational Analysis , 2014, Computer Vision, A Reference Guide.

[2]  Jane J. Ye,et al.  Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems , 1997, SIAM J. Optim..

[3]  Jane J. Ye,et al.  Optimality Conditions for Optimization Problems with Complementarity Constraints , 1999, SIAM J. Optim..

[4]  Boris S. Mordukhovich,et al.  Necessary Conditions in Multiobjective Optimization with Equilibrium Constraints , 2007 .

[5]  Stefan Scholtes,et al.  Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity , 2000, Math. Oper. Res..

[6]  Jiří V. Outrata,et al.  Optimality Conditions for Disjunctive Programs with Application to Mathematical Programs with Equilibrium Constraints , 2007 .

[7]  Zun-Quan Xia,et al.  An alternating linearization method with inexact data for bilevel nonsmooth convex optimization , 2013 .

[8]  B. Mordukhovich,et al.  New necessary optimality conditions in optimistic bilevel programming , 2007 .

[9]  B. Mordukhovich.  Generalized Differential Calculus for Nonsmooth and Set-Valued Mappings , 1994 .

[10]  Boris S. Mordukhovich,et al.  Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming , 2012, SIAM J. Optim..

[11]  Kazimierz Malanowski,et al.  Book review: "Variational analysis and generalized differentiation. I Basic Theory, II Applications" , 2006 .

[12]  Bergakademie Freiberg,et al.  BILEVEL PROGRAMMING: REFORMULATIONS, REGULARITY, AND STATIONARITY , 2012 .

[13]  Stephan Dempe,et al.  On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem , 2010 .

[14]  S. Nobakhtian,et al.  Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints , 2010 .

[15]  Georg Still,et al.  Solving bilevel programs with the KKT-approach , 2012, Mathematical Programming.

[16]  J. Treiman,et al.  Lagrange Multipliers for Nonconvex Generalized Gradients with Equality, Inequality, and Set Constraints , 1999 .

[17]  Jane J. Ye,et al.  Optimality conditions for bilevel programming problems , 1995 .

[18]  J. Hiriart-Urruty.  Refinements of necessary optimality conditions in nondifferentiable programming I , 1979 .

[19]  Hubertus Th. Jongen,et al.  MPCC: Critical Point Theory , 2009, SIAM J. Optim..

[20]  Boris Polyak,et al.  B.S. Mordukhovich. Variational Analysis and Generalized Differentiation. I. Basic Theory, II. Applications , 2009 .

[21]  Boris S. Mordukhovich,et al.  Variational Analysis of Marginal Functions with Applications to Bilevel Programming , 2012, J. Optim. Theory Appl..

[22]  René Henrion,et al.  On the Calmness of a Class of Multifunctions , 2002, SIAM J. Optim..

[23]  J. J. Ye,et al.  Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints , 1997, Math. Oper. Res..

[24]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[25]  J. Hiriart-Urruty.  Refinements of necessary optimality conditions in nondifferentiable programming II , 1979 .

[26]  R. Henrion,et al.  On calmness conditions in convex bilevel programming , 2011 .

[27]  Mikhail V. Solodov,et al.  A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems , 2007, SIAM J. Optim..

[28]  Stephan Dempe,et al.  Is bilevel programming a special case of a mathematical program with complementarity constraints? , 2012, Math. Program..

[29]  F. Giannessi.  Variational Analysis and Generalized Differentiation , 2006 .

[30]  Boris S. Mordukhovich,et al.  Second-Order Subdifferential Calculus with Applications to Tilt Stability in Optimization , 2011, SIAM J. Optim..

[31]  Stephan Dempe,et al.  New Optimality Conditions for the Semivectorial Bilevel Optimization Problem , 2012, Journal of Optimization Theory and Applications.

[32]  L. Muu,et al.  Bilevel Optimization as a Regularization Approach to Pseudomonotone Equilibrium Problems , 2014 .

[33]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[34]  Jane J. Ye,et al.  Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints , 2005 .

[35]  Alain B. Zemkoho,et al.  Necessary optimality conditions in pessimistic bilevel programming , 2014 .

[36]  S. Nobakhtian,et al.  Constraint Qualifications for Nonsmooth Mathematical Programs with Equilibrium Constraints , 2009 .

[37]  S. M. Robinson.  Generalized equations and their solutions, Part I: Basic theory , 1979 .

[38]  Xiaotie Deng,et al.  Complexity Issues in Bilevel Linear Programming , 1998 .

[39]  Karl Kunisch,et al.  A Bilevel Optimization Approach for Parameter Learning in Variational Models , 2013, SIAM J. Imaging Sci..