A new elementary proof for M-stationarity under MPCC-GCQ for mathematical programs with complementarity constraints

TL;DR

This paper provides a simpler, elementary proof that local minimizers of MPCCs are M-stationary under MPCC-GCQ, avoiding complex calculus tools and proving a previously open conjecture.

Contribution

It introduces a new elementary proof for M-stationarity in MPCCs under MPCC-GCQ, simplifying existing proofs and resolving an open conjecture.

Findings

Simplified proof of M-stationarity under MPCC-GCQ

Verification of a previously open conjecture

Elimination of complex calculus tools in proof

Abstract

It is known in the literature that local minimizers of mathematical programs with complementarity constraints (MPCCs) are so-called M-stationary points, if a weak MPCC-tailored Guignard constraint qualification (called MPCC-GCQ) holds. In this paper we present a new elementary proof for this result. Our proof is significantly simpler than existing proofs and does not rely on deeper technical theory such as calculus rules for limiting normal cones. A crucial ingredient is a proof of a (to the best of our knowledge previously open) conjecture, which was formulated in a Diploma thesis by Schinabeck.