Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Iteration bound O(n log⁡(nμ0/ε))O(\sqrt{n}\,\log(n\mu^0/\varepsilon))O(n​log(nμ0/ε)) for the primal path following algorithm

Proved
LinearOptimization.interior_point_path_following_iterations

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

complexityduality-gapinterior-pointnewton-methodpath-following

(Theorem 9.7, p. 426, GOAL — iteration bound for primal path following) Assume that the primal path following algorithm uses

α=1−β−ββ+n,\alpha = 1 - \frac{\sqrt{\beta} - \beta}{\sqrt{\beta} + \sqrt{n}},α=1−β​+n​β​−β​,

where β<1\beta < 1β<1 [formally 0<β<10 < \beta < 10<β<1; see design_note], and starts with an initial primal and dual feasible solution (x0,s0,p0)(\mathbf{x}^0, \mathbf{s}^0, \mathbf{p}^0)(x0,s0,p0), with x0>0\mathbf{x}^0 > \mathbf{0}x0>0, s0>0\mathbf{s}^0 > \mathbf{0}s0>0, that satisfies

∥1μ0X0S0e−e∥≤β.\left\| \frac{1}{\mu^0} X_0 S_0 \mathbf{e} - \mathbf{e} \right\| \le \beta.​μ01​X0​S0​e−e​≤β.

Then, after

K=⌈β+nβ−β log⁡(s0)′x0(1+β)ε(1−β)⌉K = \left\lceil \frac{\sqrt{\beta} + \sqrt{n}}{\sqrt{\beta} - \beta} \, \log \frac{(\mathbf{s}^0)'\mathbf{x}^0 (1+\beta)}{\varepsilon(1-\beta)} \right\rceilK=⌈β​−ββ​+n​​logε(1−β)(s0)′x0(1+β)​⌉

iterations, it finds a primal and dual feasible solution (xK,sK,pK)(\mathbf{x}^K, \mathbf{s}^K, \mathbf{p}^K)(xK,sK,pK) with duality gap

(sK)′xK≤ε.(\mathbf{s}^K)'\mathbf{x}^K \le \varepsilon.(sK)′xK≤ε.
Preamble
import Definitions.Def_LinearOptimization_PathFollowing


open Matrix

/-- **Bertsimas & Tsitsiklis, Theorem 9.7 (p. 426).** Primal path following reaches duality
gap `≤ ε` — primal and dual feasibly — within
`K = ⌈((√β + √n)/(√β − β)) log((s⁰)'x⁰(1+β)/(ε(1−β)))⌉` iterations, when
run with `α = 1 − (√β − β)/(√β + √n)` from a `β`-close interior feasible
start. -/
Formal statement
theorem LinearOptimization.interior_point_path_following_iterations {m n : ℕ}
    (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
    (hrank : LinearIndependent ℝ (fun i => A i))
    (beta eps alpha : ℝ) (hbeta0 : 0 < beta) (hbeta1 : beta < 1)
    (heps : 0 < eps)
    (halpha : alpha = 1 -
      (Real.sqrt beta - beta) / (Real.sqrt beta + Real.sqrt n))
    (x : ℕ → Fin n → ℝ) (p : ℕ → Fin m → ℝ) (s : ℕ → Fin n → ℝ)
    (mu : ℕ → ℝ) (hmu0 : 0 < mu 0)
    (hxfeas0 : A.mulVec (x 0) = b) (hx0 : ∀ j, 0 < x 0 j)
    (hsfeas0 : Aᵀ.mulVec (p 0) + s 0 = c) (hs0 : ∀ j, 0 < s 0 j)
    (hprox0 : centralPathProximity (mu 0) (x 0) (s 0) ≤ beta)
    (hrun : IsPathFollowingRun A c alpha x p s mu)
    (K : ℕ)
    (hK : K = ⌈(Real.sqrt beta + Real.sqrt n) / (Real.sqrt beta - beta) *
      Real.log ((s 0 ⬝ᵥ x 0) * (1 + beta) / (eps * (1 - beta)))⌉₊) :
    A.mulVec (x K) = b ∧ 0 ≤ x K ∧
      Aᵀ.mulVec (p K) + s K = c ∧ 0 ≤ s K ∧
      s K ⬝ᵥ x K ≤ eps := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 9.7, p. 426 (proof pp. 427-429; final display and Eq. (9.23) p. 429)

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