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

jnsao:6903 - Journal of Nonsmooth Analysis and Optimization, October 22, 2021, Volume 2 - https://doi.org/10.46298/jnsao-2021-6903
A new elementary proof for M-stationarity under MPCC-GCQ for mathematical programs with complementarity constraintsArticle

Authors: Felix Harder ORCID

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.

Comment: 7 pages

https://doi.org/10.46298/jnsao-2021-6903
Source: arXiv.org:2011.04474
Volume: Volume 2
Section: Original research articles
Published on: October 22, 2021
Accepted on: October 20, 2021
Submitted on: November 13, 2020
Keywords: Mathematics - Optimization and Control, 90C33 (Primary) 90C30 (Secondary)
Licence: Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)
Funding:
    Source : OpenAIRE Graph
  • Non-smooth and Complementarity-Based Distributed Parameter Systems: Simulation and Hierarchical Optimization; Funder: Deutsche Forschungsgemeinschaft; Code: 274039581/SPP 1962

1 Document citing this article

Share and export

Consultation statistics

This page has been seen 603 times.
This article's PDF has been downloaded 562 times.