Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.1, p. 27 — the updated lower bound satisfies ζ⁺ ≤ ζ∗ and ⟨c, x̂⟩ − ζ⁺ ≤ νσ_x̂(−p)

Proved
SelfScaledLongStep.Karmarkar.lemma_7_1

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

interior-pointkarmarkarp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-reductionself-scaled-barrier

Let K⊆E=RnK\subseteq E=\mathbb R^nK⊆E=Rn be a self-scaled cone with a ν\nuν-self-scaled barrier FFF (ν≥1\nu\ge1ν≥1). Consider the problem

(P)min⁡ ⟨c,x⟩s.t.Bx=0, ⟨d,x⟩=1, x∈K,(P)\qquad \min\ \langle c,x\rangle\quad\text{s.t.}\quad Bx=0,\ \langle d,x\rangle=1,\ x\in K,(P)min ⟨c,x⟩s.t.Bx=0, ⟨d,x⟩=1, x∈K,

with B:E→RmB:E\to\mathbb R^mB:E→Rm linear and surjective and d∈K∗d\in K^*d∈K∗, and assume that the dual

(D)max⁡ ζs.t.B∗y+dζ+s=c, s∈K∗(D)\qquad \max\ \zeta\quad\text{s.t.}\quad B^*y+d\zeta+s=c,\ s\in K^*(D)max ζs.t.B∗y+dζ+s=c, s∈K∗

has a strictly feasible solution (s∈int⁡K∗s\in\operatorname{int}K^*s∈intK∗) and that ⟨c,⋅⟩\langle c,\cdot\rangle⟨c,⋅⟩ is not constant on the feasible set of (P). Let ζ∗\zeta^*ζ∗ be the optimal value of (P).

Let x^\hat xx^ be strictly feasible for (P) and let ζ^≤ζ∗\hat\zeta\le\zeta^*ζ^​≤ζ∗. Let p(c)p(c)p(c) and p(d)p(d)p(d) be the projections of c^\hat cc^ and d^\hat dd^ into ker⁡B\ker BkerB with respect to F′′(x^)F''(\hat x)F′′(x^), i.e. Bp(u)=0Bp(u)=0Bp(u)=0, B∗y(u)+F′′(x^)p(u)=u^B^*y(u)+F''(\hat x)p(u)=\hat uB∗y(u)+F′′(x^)p(u)=u^ (7.3). Let ζ+\zeta^+ζ+ be the possibly updated lower bound: ζ+=ζ^\zeta^+=\hat\zetaζ+=ζ^​ if x~(ζ^)∉int⁡K\tilde x(\hat\zeta)\notin\operatorname{int}Kx~(ζ^​)∈/intK, and ζ+=ζ^+1/σx~(ζ^)(p(d)+x^/ν)\zeta^+=\hat\zeta+1/\sigma_{\tilde x(\hat\zeta)}(p(d)+\hat x/\nu)ζ+=ζ^​+1/σx~(ζ^​)​(p(d)+x^/ν) otherwise (7.6). Let p=p(c)−ζ+p(d)p=p(c)-\zeta^+p(d)p=p(c)−ζ+p(d) (7.5). Then ζ+≤ζ∗\zeta^+\le\zeta^*ζ+≤ζ∗ and

⟨c,x^⟩−ζ+≤ν σx^(−p).(7.7)\langle c,\hat x\rangle-\zeta^+\le\nu\,\sigma_{\hat x}(-p).\qquad(7.7)⟨c,x^⟩−ζ+≤νσx^​(−p).(7.7)

The lemma says that the lower-bound update never overshoots the optimal value, and that the resulting gap is controlled by how far one can move from x^\hat xx^ along ppp before leaving KKK. It generalizes a result of Anstreicher for linear programming, and is the bound used in the third line of the potential estimate (7.10).

Formalization Note σx(p)=min⁡{β≥0:βx−p∈K}\sigma_x(p)=\min\{\beta\ge0:\beta x-p\in K\}σx​(p)=min{β≥0:βx−p∈K} is sigma K x p. The vectors c^\hat cc^, d^\hat dd^ are c+⟨c,x^⟩νF′(x^)c+\frac{\langle c,\hat x\rangle}{\nu}F'(\hat x)c+ν⟨c,x^⟩​F′(x^), d+⟨d,x^⟩νF′(x^)d+\frac{\langle d,\hat x\rangle}{\nu}F'(\hat x)d+ν⟨d,x^⟩​F′(x^) (the page prints "−-−", a misprint; see the definitions item). The projections are taken as data (y(c),p(c))(y(c),p(c))(y(c),p(c)), (y(d),p(d))(y(d),p(d))(y(d),p(d)) satisfying (7.3); they are unique by Proposition 6.1. E∗E^*E∗ is identified with EEE; the barrier's Hessian is assumed nondegenerate (implied for a pointed cone); the conjugate barrier is a supremum over int⁡K\operatorname{int}KintK. Strict feasibility of (P) is implied by x^\hat xx^; strict feasibility of (D) is assumption (6.3) of §6 and makes ζ∗\zeta^*ζ∗ finite. The hypothesis ν≥1\nu\ge1ν≥1 is a consequence of pointedness stated on p. 3, taken as a binder.

Preamble
import Mathlib
import Definitions.Def_dualCone
import Definitions.Def_SelfScaledIPM_ShortStep_Setting
import Definitions.Def_SelfScaledIPM_ShortStep_Measures
import Definitions.Def_SelfScaledLongStep_Karmarkar_Defs

open scoped InnerProductSpace
open SelfScaledIPM.ShortStep
Formal statement
namespace SelfScaledLongStep.Karmarkar

/-- **Lemma 7.1** (p. 27). Let `x̂ ∈ S⁰(P)` and `ζ̂ ≤ ζ*`, let `p(c)`, `p(d)` solve (7.3) for
`û = ĉ`, `û = d̂`, let `ζ⁺` be the possibly updated lower bound (7.6) and `p = p(c) − ζ⁺p(d)`
(7.5). Then `ζ⁺ ≤ ζ*` and (7.7) `⟨c, x̂⟩ − ζ⁺ ≤ ν σ_x̂(−p)`. -/
theorem lemma_7_1
    {n m : ℕ} (K : Set (EuclideanSpace ℝ (Fin n))) (hK : IsProperCone K)
    (F : EuclideanSpace ℝ (Fin n) → ℝ) (ν : ℝ) (hν : 1 ≤ ν) (hF : IsSelfScaledBarrier K F ν)
    (B : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin m)) (hB : Function.Surjective B)
    (c d : EuclideanSpace ℝ (Fin n)) (hd : d ∈ ConvexOptimization.dualCone K)
    (hD : ∃ (y : EuclideanSpace ℝ (Fin m)) (ζ : ℝ) (s : EuclideanSpace ℝ (Fin n)),
      s ∈ interior (ConvexOptimization.dualCone K) ∧
        ContinuousLinearMap.adjoint B y + ζ • d + s = c)
    (hnc : ∃ x₁ x₂ : EuclideanSpace ℝ (Fin n),
      KarFeasible K B d x₁ ∧ KarFeasible K B d x₂ ∧ ⟪c, x₁⟫_ℝ ≠ ⟪c, x₂⟫_ℝ)
    (xh : EuclideanSpace ℝ (Fin n)) (hxh : KarStrict K B d xh)
    (ζh : ℝ) (hζh : ζh ≤ zetaStar K B c d)
    (yc : EuclideanSpace ℝ (Fin m)) (pc : EuclideanSpace ℝ (Fin n))
    (hpc : SelfScaledLongStep.PrimalDual.IsProjection F B xh (cHat F ν c xh) yc pc)
    (yd : EuclideanSpace ℝ (Fin m)) (pd : EuclideanSpace ℝ (Fin n))
    (hpd : SelfScaledLongStep.PrimalDual.IsProjection F B xh (dHat F ν d xh) yd pd) :
    let ζp := zetaPlus K ν c d xh pc pd ζh
    let p := karDir pc pd ζp
    ζp ≤ zetaStar K B c d ∧ ⟪c, xh⟫_ℝ - ζp ≤ ν * sigma K xh (-p) := by sorry

end SelfScaledLongStep.Karmarkar
Source
Nesterov & Todd, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res. 22(1) (1997) 1–42, p. 27, Lemma 7.1, (7.7); standing assumptions (6.1)–(6.3), §7 p. 25
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

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