Lemma 4, p. 14 — ‖(h − Kz)⁺‖ ≤ ρ_r(z)√(1 + R²) for z ∈ W_R(0), r ∈ (0, R]
ProvedRestartPD.LPSharp.lemma_4kkt-systemlinear-programmingnormalized-duality-gapp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let , , , let be the Lagrangian (19) on , equipped with the Euclidean norm, and let be the KKT data (20). Suppose (19) has a saddle point. Then for all , and ,
The KKT residual, a standard stopping criterion for LP, is thus bounded by the normalized duality gap; combined with Hoffman's bound this gives sharpness of LP (Lemma 5).
Formalization Note The inequality is stated in the extended reals, with coerced. The hypothesis that a solution exists is kept as on the page, although it is not needed for the inequality.
Preamble
import Mathlib import Definitions.Def_RestartPD_LPSharp_PrimalDual import Definitions.Def_RestartPD_LPSharp_LP open scoped InnerProductSpace Matrix
Formal statement
namespace RestartPD.LPSharp
theorem lemma_4 {n m : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : EuclideanSpace ℝ (Fin m))
(c : EuclideanSpace ℝ (Fin n)) (hsol : (Zstar (lpL A b c) lpX Set.univ).Nonempty)
(R r : ℝ) (hR : 0 < R) (hr : 0 < r) (hrR : r ≤ R) (z : PDSpace n m)
(hz : z ∈ Wball lpX Set.univ R 0) :
((kktRes A b c z : ℝ) : EReal) ≤
rho (lpL A b c) lpX Set.univ r z * ((Real.sqrt (1 + R ^ 2) : ℝ) : EReal) := by sorry
end RestartPD.LPSharp
Source
Applegate, Hinder, Lu & Lubin, Faster First-Order Primal-Dual Methods for Linear Programming using Restarts and Sharpness, arXiv:2105.12715v4, p. 14, Lemma 4
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.