论文标题
MPCC-GCQ下的M-STATATION性的新基本证明，用于具有互补性约束的数学程序
A new elementary proof for M-stationarity under MPCC-GCQ for mathematical programs with complementarity constraints
论文作者
论文摘要
在文献中已经知道，如果MPCC较弱的Guignard约束资格（称为MPCC-GCQ）持有，则具有互补性约束（MPCC）的数学程序的局部最小化是所谓的M-STATIONARY点。在本文中，我们为此结果提供了一个新的基本证明。我们的证明比现有证据要简单得多，并且不依赖更深层的技术理论，例如限制正常锥体的微积分规则。至关重要的成分证明了A（据我们所知，以前开放的）猜想，这是由Schinabeck在文凭论文中提出的。
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.
