Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Constant potential reduction yields an explicit iteration bound

Proved
LinearOptimization.interior_point_potential_reduction

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

complexityduality-gapinterior-pointpotential-reduction

(Theorem 9.4, p. 410 — generic potential-reduction iteration bound, Section 9.3) Define the potential function

G(x,s)=qlog⁡s′x−∑j=1nlog⁡xj−∑j=1nlog⁡sj,G(\mathbf{x}, \mathbf{s}) = q\log \mathbf{s}'\mathbf{x} - \sum_{j=1}^n \log x_j - \sum_{j=1}^n \log s_j,G(x,s)=qlogs′x−j=1∑n​logxj​−j=1∑n​logsj​,

where qqq is a constant larger than nnn (p. 409). Let x0>0\mathbf{x}^0 > \mathbf{0}x0>0 and (p0,s0)(\mathbf{p}^0, \mathbf{s}^0)(p0,s0) with s0>0\mathbf{s}^0 > \mathbf{0}s0>0 be feasible solutions to the primal and dual problem, respectively. Let ε>0\varepsilon > 0ε>0 be the optimality tolerance.

Any algorithm that maintains primal and dual feasibility and reduces G(x,s)G(\mathbf{x}, \mathbf{s})G(x,s) by an amount greater than or equal to δ>0\delta > 0δ>0 at each iteration finds a solution to the primal and dual problems with duality gap

(sK)′xK≤ε,(\mathbf{s}^K)'\mathbf{x}^K \le \varepsilon,(sK)′xK≤ε,

after

K=⌈G(x0,s0)+(q−n)log⁡(1/ε)−nlog⁡nδ⌉K = \left\lceil \frac{G(\mathbf{x}^0, \mathbf{s}^0) + (q-n)\log(1/\varepsilon) - n\log n}{\delta} \right\rceilK=⌈δG(x0,s0)+(q−n)log(1/ε)−nlogn​⌉

iterations.

Preamble
import Definitions.Def_LinearOptimization_LogBarrier_CentralPath
import Definitions.Def_LinearOptimization_InteriorPointPotential


open Matrix

/-- **Bertsimas & Tsitsiklis, Theorem 9.4 (p. 410).** Potential reduction implies an explicit
iteration bound: if every step keeps `(x^k, s^k)` interior primal-dual
feasible and cuts `G` by at least `δ`, then after
`K = ⌈(G(x⁰, s⁰) + (q − n) log(1/ε) − n log n) / δ⌉` iterations the
duality gap satisfies `(s^K)'x^K ≤ ε`. -/
Formal statement
theorem LinearOptimization.interior_point_potential_reduction {m n : ℕ}
    (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
    (q delta eps : ℝ) (hq : (n : ℝ) < q) (hdelta : 0 < delta)
    (heps : 0 < eps)
    (x : ℕ → Fin n → ℝ) (p : ℕ → Fin m → ℝ) (s : ℕ → Fin n → ℝ)
    (hfeas : ∀ k, A.mulVec (x k) = b ∧ (∀ j, 0 < x k j) ∧
      Aᵀ.mulVec (p k) + s k = c ∧ (∀ j, 0 < s k j))
    (hdec : ∀ k, interiorPointPotential q (x (k + 1)) (s (k + 1)) ≤
      interiorPointPotential q (x k) (s k) - delta)
    (K : ℕ)
    (hK : K = ⌈(interiorPointPotential q (x 0) (s 0) +
      (q - n) * Real.log (1 / eps) - n * Real.log n) / delta⌉₊) :
    s K ⬝ᵥ x K ≤ eps := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 9.4, p. 410 (potential function p. 409, Assumption 9.3 p. 409)

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