The University of Southampton
University of Southampton Institutional Repository

KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization

KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization
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 (MPECs), 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 coderivative estimate for the PSLLL that we also provide in this paper.
1052-6234
1639-1669
Dempe, Stephan
a8716b3e-ae75-4998-a6b6-48a9171b925a
Zemkoho, Alain B.
30c79e30-9879-48bd-8d0b-e2fbbc01269e
Dempe, Stephan
a8716b3e-ae75-4998-a6b6-48a9171b925a
Zemkoho, Alain B.
30c79e30-9879-48bd-8d0b-e2fbbc01269e

Dempe, Stephan and Zemkoho, Alain B. (2014) KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization. SIAM Journal on Optimization, 24 (4), 1639-1669. (doi:10.1137/130917715).

Record type: Article

Abstract

For a long time, the bilevel programming problem has essentially been considered as a special case of mathematical programs with equilibrium constraints (MPECs), 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 coderivative estimate for the PSLLL that we also provide in this paper.

Text
Nonsmooth KKT.pdf - Accepted Manuscript
Download (441kB)

More information

Accepted/In Press date: 25 August 2014
e-pub ahead of print date: 14 October 2014
Published date: 2014
Organisations: Operational Research

Identifiers

Local EPrints ID: 370786
URI: http://eprints.soton.ac.uk/id/eprint/370786
ISSN: 1052-6234
PURE UUID: 415ef956-7bbc-48fd-bc45-15ba774322bc
ORCID for Alain B. Zemkoho: ORCID iD orcid.org/0000-0003-1265-4178

Catalogue record

Date deposited: 06 Nov 2014 13:25
Last modified: 15 Mar 2024 03:51

Export record

Altmetrics

Contributors

Author: Stephan Dempe

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×