Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.8) under MFCQ, proof of Theorem 4.2, p. 10 — the multipliers of an approximate KKT sequence are bounded

Proved
AugLagLLC.KKT.mfcq_multipliers_bounded

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

constraint-qualificationmfcqmultiplier-estimatesp2o-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 MFCQ, 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κ with [bk]j≥0[b_k]_j\ge 0[bk​]j​≥0 for all jjj, [bk]j=0[b_k]_j=0[bk​]j​=0 whenever Gj(x∗)<0G_j(x_*)<0Gj​(x∗​)<0, and

∇F(yk)+∑i∈ι[ak]i∇Hi(yk)+∑j∈κ[bk]j∇Gj(yk) ⟶ 0.\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 .∇F(yk​)+i∈ι∑​[ak​]i​∇Hi​(yk​)+j∈κ∑​[bk​]j​∇Gj​(yk​) ⟶ 0.

Then the sequences {ak}\{a_k\}{ak​} and {bk}\{b_k\}{bk​} are bounded: there is CCC with

∥ak∥∞≤Cand∥bk∥∞≤Cfor all k.\|a_k\|_\infty\le C\quad\text{and}\quad\|b_k\|_\infty\le C\qquad\text{for all }k .∥ak​∥∞​≤Cand∥bk​∥∞​≤Cfor all k.

Applied to (4.11) along a subsequence of Algorithm 3.1 converging to x∗x_*x∗​, this gives the boundedness (4.8) of the multiplier estimates λk+1\lambda_{k+1}λk+1​, μk+1\mu_{k+1}μk+1​, vkv_kvk​, uku_kuk​.

Formalization Note. The norms are the sup norms on ι → ℝ and κ → ℝ, matching the BkB_kBk​ of the page. Boundedness for all kkk is equivalent to boundedness from some index on, since finitely many terms are bounded.

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

open Filter Topology

/-- (4.8) under MFCQ, proof of Theorem 4.2, p. 10, without the algorithm: in the setting of
`cpld_limit_kkt` with MFCQ at `xs` in place of CPLD, the coefficient sequences `aₖ`, `bₖ` are
bounded (in the sup norm). -/
theorem mfcq_multipliers_bounded {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)
    (hmfcq : MFCQAt 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)) :
    ∃ C : ℝ, ∀ k, ‖a k‖ ≤ C ∧ ‖b k‖ ≤ C := by sorry

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