Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.11)–(4.15), proof of Theorem 4.2, pp. 9–10 — approximate KKT sequences converge to KKT points under CPLD

Proved
AugLagLLC.KKT.cpld_limit_kkt

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

approximate-kktconstraint-qualificationcpldkktp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the nonlinear program "minimize F(x)F(x)F(x) subject to Hi(x)=0H_i(x)=0Hi​(x)=0 (i∈ιi\in\iotai∈ι), Gj(x)≤0G_j(x)\le 0Gj​(x)≤0 (j∈κj\in\kappaj∈κ)" on Rn\mathbb R^nRn with finite index sets and continuously differentiable FFF, HiH_iHi​, GjG_jGj​. Let x∗x_*x∗​ be feasible and satisfy the CPLD condition, and let yk→x∗y_k\to x_*yk​→x∗​. Suppose there are coefficients ak∈Rιa_k\in\mathbb R^\iotaak​∈Rι and bk∈Rκb_k\in\mathbb R^\kappabk​∈Rκ such that, for every kkk,

  1. [bk]j≥0[b_k]_j\ge 0[bk​]j​≥0 for all jjj, and [bk]j=0[b_k]_j=0[bk​]j​=0 whenever Gj(x∗)<0G_j(x_*)<0Gj​(x∗​)<0;
  2. the residual tends to zero:
∇F(yk)+∑i∈ι[ak]i∇Hi(yk)+∑j∈κ[bk]j∇Gj(yk) ⟶ 0(k→∞).\nabla F(y_k)+\sum_{i\in\iota}[a_k]_i\nabla H_i(y_k)+\sum_{j\in\kappa}[b_k]_j\nabla G_j(y_k)\ \longrightarrow\ 0\qquad(k\to\infty).∇F(yk​)+i∈ι∑​[ak​]i​∇Hi​(yk​)+j∈κ∑​[bk​]j​∇Gj​(yk​) ⟶ 0(k→∞).

Then x∗x_*x∗​ is a KKT point of the program.

This is the core of Theorem 4.2 with the algorithm abstracted away: by (4.9) and (4.10), the iterates of Algorithm 3.1 along a subsequence converging to x∗x_*x∗​ satisfy (4.11), which is exactly the hypothesis above with F=fF=fF=f, the equality constraints h1,h2h_1,h_2h1​,h2​, the inequality constraints g1,g2g_1,g_2g1​,g2​, and ak=(λk+1,vk)a_k=(\lambda_{k+1},v_k)ak​=(λk+1​,vk​), bk=(μk+1,uk)b_k=(\mu_{k+1},u_k)bk​=(μk+1​,uk​).

Formalization Note. The paper's index sets "k∈Kk\in Kk∈K, k≥k5k\ge k_5k≥k5​" are re-indexed as the whole sequence k∈Nk\in\mathbb Nk∈N. The sign and support conditions on bkb_kbk​ refer to the constraints inactive at the limit x∗x_*x∗​, as in (4.11), not at yky_kyk​. CPLD and KKT are the definitions of AugLagLLC.KKT.ConstraintQualifications.

Preamble
import Mathlib
import Definitions.Def_AugLagLLC_KKT_ConstraintQualifications
Formal statement
namespace AugLagLLC.KKT

open Filter Topology

/-- (4.11)–(4.15), proof of Theorem 4.2, pp. 9–10, without the algorithm: let `F`, `H i`, `G j`
be `C¹`, let `xs` be feasible and satisfy CPLD, and let `yₖ → xs`. If there are coefficients
`aₖ` (free) and `bₖ ≥ 0`, with `[bₖ]ⱼ = 0` for every constraint inactive at `xs`, such that
`∇F(yₖ) + ∑ᵢ [aₖ]ᵢ ∇Hᵢ(yₖ) + ∑ⱼ [bₖ]ⱼ ∇Gⱼ(yₖ) → 0`, then `xs` is a KKT point. -/
theorem cpld_limit_kkt {n : ℕ} {ι κ : Type*} [Fintype ι] [Fintype κ]
    {F : EuclideanSpace ℝ (Fin n) → ℝ} {H : ι → EuclideanSpace ℝ (Fin n) → ℝ}
    {G : κ → EuclideanSpace ℝ (Fin n) → ℝ}
    (hF : ContDiff ℝ 1 F) (hH : ∀ i, ContDiff ℝ 1 (H i)) (hG : ∀ j, ContDiff ℝ 1 (G j))
    {xs : EuclideanSpace ℝ (Fin n)} (hHx : ∀ i, H i xs = 0) (hGx : ∀ j, G j xs ≤ 0)
    (hcpld : CPLDAt H G xs)
    {y : ℕ → EuclideanSpace ℝ (Fin n)} (hy : Tendsto y atTop (𝓝 xs))
    (a : ℕ → ι → ℝ) (b : ℕ → κ → ℝ) (hb : ∀ k j, 0 ≤ b k j)
    (hbG : ∀ k j, G j xs < 0 → b k j = 0)
    (hres : Tendsto (fun k => gradient F (y k) + ∑ i, a k i • gradient (H i) (y k)
        + ∑ j, b k j • gradient (G j) (y k)) atTop (𝓝 0)) :
    IsKKT F H G xs := by sorry

end AugLagLLC.KKT
Source
Andreani, Birgin, Martínez & Schuverdt, On augmented Lagrangian methods with general lower-level constraints, HAL hal-01295437v1, pp. 9–10, proof of Theorem 4.2, (4.11)–(4.15)
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