Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.9), p. 17 — for p ∈ K: F(x + αp) ≤ F(x) + α⟨F′(x), p⟩ + (α²/2)‖p‖²_x for all α ≥ 0

Open
SelfScaledLongStep.PrimalDual.eq_4_9

by tianyipeng · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

interior-pointlong-stepself-scaled-barrier

Let K⊆E=RnK\subseteq E=\mathbb R^nK⊆E=Rn be a proper cone with a ν\nuν-self-scaled barrier FFF (ν≥1\nu\ge1ν≥1). Let x∈int⁡Kx\in\operatorname{int}Kx∈intK and p∈Kp\in Kp∈K. Then for every α≥0\alpha\ge0α≥0,

F(x+αp)≤F(x)+α⟨F′(x),p⟩+α22 ∥p∥x2,(4.9)F(x+\alpha p)\le F(x)+\alpha\langle F'(x),p\rangle+\frac{\alpha^2}{2}\,\|p\|_x^2,\qquad(4.9)F(x+αp)≤F(x)+α⟨F′(x),p⟩+2α2​∥p∥x2​,(4.9)

where ∥p∥x=⟨F′′(x)p,p⟩1/2\|p\|_x=\langle F''(x)p,p\rangle^{1/2}∥p∥x​=⟨F′′(x)p,p⟩1/2.

This is the form of Theorem 4.2 (4.8) in the degenerate case σx(−p)=0\sigma_x(-p)=0σx​(−p)=0 (i.e. −(−p)=p∈K-(-p)=p\in K−(−p)=p∈K): the paper notes that the argument of Theorem 4.1 for σx(p)=0\sigma_x(p)=0σx​(p)=0 gives F′′(x+βp)⪯F′′(x)F''(x+\beta p)\preceq F''(x)F′′(x+βp)⪯F′′(x) for all β≥0\beta\ge0β≥0, and integrating twice along the ray yields (4.9). The step x+αpx+\alpha px+αp stays in int⁡K\operatorname{int}KintK for every α≥0\alpha\ge0α≥0.

Formalization note. Same setting and conventions as SelfScaledLongStep.PrimalDual.theorem_4_2: E=E∗=RnE=E^*=\mathbb R^nE=E∗=Rn via the inner product, F′(x)F'(x)F′(x) is gradient F x, ∥p∥x\|p\|_x∥p∥x​ is lnorm F x p.

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

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

/-- **(4.9)** (p. 17), the `σ_x(−p) = 0` companion of Theorem 4.2: for `x ∈ int K`, `p ∈ K`
and every `α ≥ 0`,
`F(x + αp) ≤ F(x) + α⟨F'(x), p⟩ + (α²/2)‖p‖²_x`. -/
theorem eq_4_9 {n : ℕ} (K : Set (EuclideanSpace ℝ (Fin n))) (hK : IsProperCone K)
    (F : EuclideanSpace ℝ (Fin n) → ℝ) (ν : ℝ) (hν : 1 ≤ ν) (hF : IsSelfScaledBarrier K F ν)
    (x p : EuclideanSpace ℝ (Fin n)) (hx : x ∈ interior K) (hp : p ∈ K)
    (α : ℝ) (hα0 : 0 ≤ α) :
    F (x + α • p) ≤ F x + α * ⟪gradient F x, p⟫_ℝ + α ^ 2 / 2 * (lnorm F x p) ^ 2 := by sorry

end SelfScaledLongStep.PrimalDual
Source
Nesterov & Todd, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res. 22(1) (1997) 1–42, p. 17, inequality (4.9) (the case σ_x(p) = 0 of Theorem 4.2)

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