Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1 — limits of stationary points of Scholtes' relaxation are C-stationary under MPEC-MFCQ

Proved
MPECRelax.ScholtesConv.theorem_3_1

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

convergencempecp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1relaxation-methodsstationarity

Consider the MPEC (1) with continuously differentiable data f,gi,hi,Gi,Hi:Rn→Rf,g_i,h_i,G_i,H_i:\mathbb R^n\to\mathbb Rf,gi​,hi​,Gi​,Hi​:Rn→R. Let {tk}↓0\{t_k\}\downarrow0{tk​}↓0, let xkx^kxk be a stationary point of Scholtes' relaxed program

RS(tk):min⁡f(x) s.t. gi(x)≤0, hj(x)=0, Gi(x)≥0, Hi(x)≥0, Gi(x)Hi(x)≤tk,R^S(t_k):\quad\min f(x)\ \text{s.t.}\ g_i(x)\le0,\ h_j(x)=0,\ G_i(x)\ge0,\ H_i(x)\ge0,\ G_i(x)H_i(x)\le t_k,RS(tk​):minf(x) s.t. gi​(x)≤0, hj​(x)=0, Gi​(x)≥0, Hi​(x)≥0, Gi​(x)Hi​(x)≤tk​,

and let xk→x∗x^k\to x^*xk→x∗ such that MPEC-MFCQ holds at x∗x^*x∗. Then

x∗ is a C-stationary point of (1),x^*\ \text{is a C-stationary point of (1)},x∗ is a C-stationary point of (1),

that is, x∗x^*x∗ is feasible for (1) and there are multipliers λ,μ,γ,ν\lambda,\mu,\gamma,\nuλ,μ,γ,ν satisfying the weak-stationarity conditions of Definition 2.3(a) together with γiνi≥0\gamma_i\nu_i\ge0γi​νi​≥0 for all i∈I00i\in I_{00}i∈I00​.

Scholtes' theorem made this conclusion under MPEC-LICQ; the paper weakens the assumption to MPEC-MFCQ, under which the KKT multipliers of the relaxed programs need not converge.

Formalization Note The paper states "{tk}↓0\{t_k\}\downarrow0{tk​}↓0"; we state tk>0t_k>0tk​>0, (tk)(t_k)(tk​) nonincreasing and tk→0t_k\to0tk​→0. The paper states "xkx^kxk is a stationary point of RS(tk)R^S(t_k)RS(tk​)"; we state that xkx^kxk is a KKT point of RS(tk)R^S(t_k)RS(tk​) as an NLP, feasibility included (p. 5). The standing C1C^1C1 assumption of p. 1 is the hypothesis hP. MPEC-MFCQ is Definition 2.4 (MFCQ for TNLP(x∗)(x^*)(x∗)). Feasibility of x∗x^*x∗ is not assumed; it is part of the conclusion.

Preamble
import Mathlib
import Definitions.Def_MPECRelax_ScholtesConv_NLP
import Definitions.Def_MPECRelax_ScholtesConv_MPEC
import Definitions.Def_MPECRelax_ScholtesConv_Scholtes

open Filter Topology
Formal statement
namespace MPECRelax.ScholtesConv

theorem theorem_3_1 {n m p l : ℕ} (P : MPEC n m p l) (hP : P.IsC1)
    (t : ℕ → ℝ) (ht_pos : ∀ k, 0 < t k) (ht_anti : Antitone t)
    (ht_lim : Tendsto t atTop (𝓝 0))
    (x : ℕ → E n) (hx : ∀ k, (P.RS (t k)).IsKKTPoint (x k))
    (xs : E n) (hxs : Tendsto x atTop (𝓝 xs)) (hCQ : P.MPEC_MFCQ xs) :
    P.IsCStationary xs := by sorry

end MPECRelax.ScholtesConv
Source
Hoheisel, Kanzow, Schwartz, Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints, Preprint 299, Univ. Würzburg, Sept. 2010, p. 9, Theorem 3.1
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me