Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 50 min ago
PreprintarXiv licencearXiv

Necessary Optimality Conditions for Bilevel Programming using Tangential Subdifferentials

Abstract

The bilevel program is an optimization problem in which the constraint involves solutions to a parametric optimization problem. It is well known that the value function reformulation provides an equivalent single-level optimization problem, but it results in a nonsmooth optimization problem that never satisfies the usual constraint qualification, such as the Mangasarian--Fromovitz constraint qualification (MFCQ). In this paper, we study necessary optimality conditions for nonsmooth bilevel programming using tangential subdifferentials. We derive a sequential enhanced tangential Fritz--John type condition for a class of nonsmooth nonlinear programs and then obtain corresponding enhanced tangential Fritz--John and enhanced tangential Karush--Kuhn--Tucker (KKT) systems by taking limits of the sequential condition. We further investigate tangential constraint qualification conditions, including T-quasinormality and a tangential cone--continuity property (T--CCP), and analyze how they guarantee the validity of tangential KKT type conditions. Finally, these results are applied to the value-function reformulation of a bilevel programming problem.

Related

  1. Necessary and sufficient conditions for optimal control of coupled forward-backward stochastic control systems driven by G-Brownian motion
    Xiaojuan Li, Mingshang Hu
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Higher-order necessary conditions for nonscattering
    Narek Hovsepyan
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  3. Necessary and Sufficient Conditions for Adaptive Stabilizability of Continuous-Time Markov Jump Linear Stochastic Systems
    Ziwei Guo
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Necessary and sufficient conditions for the self-normalized central limit theorem for independent triangular arrays
    Xiang Li, Song-Hao Liu, Qi-Man Shao +2
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  5. Necessary conditions for benchmarking next-generation AI in materials discovery
    Daniel E Widdowson, Tatiana V Kurlina, Olga D Anosova +1
    arXivPreprintCC BY-NC-ND 4.0Full textGeometry & topologyCondensed matterarXiv
BibTeX
@misc{luo2026necessary,
  title = {{Necessary Optimality Conditions for Bilevel Programming using Tangential Subdifferentials}},
  author = {Huilin Luo},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.36948},
  eprint = {2609.36948},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.36948},
}
RIS
TY  - UNPB
TI  - Necessary Optimality Conditions for Bilevel Programming using Tangential Subdifferentials
AU  - Huilin Luo
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2609.36948
UR  - https://arxiv.org/abs/2609.36948
AB  - The bilevel program is an optimization problem in which the constraint involves solutions to a parametric optimization problem. It is well known that the value function reformulation provides an equivalent single-level optimization problem, but it results in a nonsmooth optimization problem that never satisfies the usual constraint qualification, such as the Mangasarian--Fromovitz constraint qualification (MFCQ). In this paper, we study necessary optimality conditions for nonsmooth bilevel programming using tangential subdifferentials. We derive a sequential enhanced tangential Fritz--John type condition for a class of nonsmooth nonlinear programs and then obtain corresponding enhanced tangential Fritz--John and enhanced tangential Karush--Kuhn--Tucker (KKT) systems by taking limits of the sequential condition. We further investigate tangential constraint qualification conditions, including T-quasinormality and a tangential cone--continuity property (T--CCP), and analyze how they guarantee the validity of tangential KKT type conditions. Finally, these results are applied to the value-function reformulation of a bilevel programming problem.
ER  -