Theorem 4.1 — approximate minimizers of along a bounded maximizing dual sequence are asymptotically minimizing
ProvedPenaltyLag.Asymptotic.theorem_4_1Throughout, is a nonempty convex subset of a real vector space and are convex (the paper's standing assumption of §3, p. 358). Suppose the asymptotic optimal value in (P) is finite. Let , let be a bounded maximizing sequence for , i.e. , and for each let satisfy
where . Then is an asymptotically minimizing sequence for (P): for every , and equals the asymptotic optimal value in (P).
This is the paper's headline result: any method that maximizes the smooth, unconstrained dual over all of , using only approximate minimizations of , produces an asymptotically optimal primal sequence, with no constraint qualification and no assumption that (P) has feasible or optimal solutions.
Formalization Note (4.7) is written in EReal, equivalent to the printed difference because is real and ; it avoids EReal subtraction. Only is assumed (nonnegativity follows from (4.7)). "Maximizing" is convergence in EReal to the supremum over all of , with no sign restriction on ; "bounded" is boundedness of in ; "finite" is in EReal. The paper's functions are total functions convex on , and only their values on enter; constraint indices are Fin m (0-based, the paper's ), and is a separate argument; the standing assumption (p. 358: nonempty convex, convex) is a hypothesis even where the statement does not repeat it.
import Mathlib import Definitions.Def_PenaltyLag_Asymptotic_Basic open Filter Topology
namespace PenaltyLag.Asymptotic
/-- Theorem 4.1 (p. 365): if the asymptotic optimal value in (P) is finite, {yᵏ} is a bounded
maximizing sequence for (D_r), r > 0, and xᵏ ∈ X satisfies L_r(xᵏ, yᵏ) − g_r(yᵏ) ≤ αₖ (4.7) with
αₖ → 0, then {xᵏ} is an asymptotically minimizing sequence for (P). -/
theorem theorem_4_1 {E : Type*} [AddCommGroup E] [Module ℝ E] {m : ℕ}
(X : Set E) (hX : Convex ℝ X) (hXne : X.Nonempty)
(f₀ : E → ℝ) (f : Fin m → E → ℝ) (hf₀ : ConvexOn ℝ X f₀) (hf : ∀ i, ConvexOn ℝ X (f i))
(hfin : asympValue X f₀ f ≠ ⊥ ∧ asympValue X f₀ f ≠ ⊤)
(r : ℝ) (hr : 0 < r)
(y : ℕ → Mult m) (hyb : Bornology.IsBounded (Set.range y)) (hymax : IsMaximizing X f₀ f r y)
(x : ℕ → E) (hxX : ∀ k, x k ∈ X)
(α : ℕ → ℝ) (hα : Tendsto α atTop (𝓝 0))
(h47 : ∀ k, (Lr f₀ f r (x k) (y k) : EReal) ≤ gr X f₀ f r (y k) + (α k : EReal)) :
IsAsympMinimizing X f₀ f x := by sorry
end PenaltyLag.Asymptotic
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.