Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sufficiency of the KKT conditions for the barrier problems (points on the central path)

Proved
LinearOptimization.interior_point_kkt_sufficiency

by Shuze Chen · Aug 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

central-pathconvex-optimizationinterior-pointkkt

(Lemma 9.5, p. 421) If x∗\mathbf{x}^*x∗, p∗\mathbf{p}^*p∗, and s∗\mathbf{s}^*s∗ satisfy conditions (9.17) [Ax∗=bA\mathbf{x}^* = \mathbf{b}Ax∗=b, x∗≥0\mathbf{x}^* \ge \mathbf{0}x∗≥0, A′p∗+s∗=cA'\mathbf{p}^* + \mathbf{s}^* = \mathbf{c}A′p∗+s∗=c, s∗≥0\mathbf{s}^* \ge \mathbf{0}s∗≥0, X∗S∗e=μeX^*S^*\mathbf{e} = \mu\mathbf{e}X∗S∗e=μe for a given μ>0\mu > 0μ>0], then they are optimal solutions to problems (9.15) and (9.16), i.e., x∗=x(μ)\mathbf{x}^* = \mathbf{x}(\mu)x∗=x(μ), p∗=p(μ)\mathbf{p}^* = \mathbf{p}(\mu)p∗=p(μ), s∗=s(μ)\mathbf{s}^* = \mathbf{s}(\mu)s∗=s(μ):

Bμ(x∗)≤Bμ(x)B_\mu(\mathbf{x}^*) \le B_\mu(\mathbf{x})Bμ​(x∗)≤Bμ​(x)

for every x>0\mathbf{x} > \mathbf{0}x>0 with Ax=bA\mathbf{x} = \mathbf{b}Ax=b (with equality iff x=x∗\mathbf{x} = \mathbf{x}^*x=x∗, so x∗\mathbf{x}^*x∗ is the unique minimizer), and symmetrically (p∗,s∗)(\mathbf{p}^*, \mathbf{s}^*)(p∗,s∗) is optimal for the dual barrier problem (9.16).

Preamble
import Definitions.Def_LinearOptimization_LogBarrier_CentralPath


open Matrix

/-- **Bertsimas & Tsitsiklis, Lemma 9.5 (p. 421).** KKT sufficiency for the barrier problems:
a solution `(x*, p*, s*)` of (9.17) at `μ > 0` has `x*` as the unique
minimizer of `B_μ` over the interior primal feasible set, and `(p*, s*)`
as a maximizer of the dual barrier objective over the interior dual
feasible set. -/
Formal statement
theorem LinearOptimization.interior_point_kkt_sufficiency {m n : ℕ}
    (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
    (mu : ℝ) (hmu : 0 < mu)
    (xstar : Fin n → ℝ) (pstar : Fin m → ℝ) (sstar : Fin n → ℝ)
    (hkkt : IsCentralPathPoint A b c mu xstar pstar sstar) :
    (∀ x : Fin n → ℝ, A.mulVec x = b → (∀ j, 0 < x j) →
      logBarrier c mu xstar ≤ logBarrier c mu x ∧
        (logBarrier c mu x = logBarrier c mu xstar → x = xstar)) ∧
    (∀ (p : Fin m → ℝ) (s : Fin n → ℝ), Aᵀ.mulVec p + s = c →
      (∀ j, 0 < s j) →
      dualLogBarrier b mu p s ≤ dualLogBarrier b mu pstar sstar) := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Lemma 9.5, p. 421

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