Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5(b) — the Armijo descent condition (23) holds for 0≤α≤min⁡{1,2λ(1−σ+σγ)/L}0 \le \alpha \le \min\{1, 2\lambda(1-\sigma+\sigma\gamma)/L\}0≤α≤min{1,2λ(1−σ+σγ)/L}

Proved
TsengCGD.Linear.lemma5_b

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

coordinate-descentline-searchnonsmooth-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider problem (1): Fc=f+cPF_c=f+cPFc​=f+cP with c>0c>0c>0, PPP proper, convex, lower semicontinuous and fff continuously differentiable on an open set containing dom⁡P\operatorname{dom}PdomP. Let x∈dom⁡Px\in\operatorname{dom}Px∈domP, H≻0nH\succ0_nH≻0n​, J⊆N\mathcal J\subseteq\mathcal NJ⊆N nonempty, d=dH(x;J)d=d_H(x;\mathcal J)d=dH​(x;J), γ∈[0,1)\gamma\in[0,1)γ∈[0,1) and Δ=∇f(x)Td+γdTHd+cP(x+d)−cP(x)\Delta=\nabla f(x)^Td+\gamma d^THd+cP(x+d)-cP(x)Δ=∇f(x)Td+γdTHd+cP(x+d)−cP(x).

Suppose ∇f\nabla f∇f is LLL-Lipschitz on dom⁡P\operatorname{dom}PdomP for some L≥0L\ge0L≥0 (condition (22)) and H⪰λ‾IH\succeq\underline\lambda IH⪰λ​I with λ‾>0\underline\lambda>0λ​>0. Then for every σ∈(0,1)\sigma\in(0,1)σ∈(0,1) the descent condition

Fc(x+αd)−Fc(x) ≤ σαΔ(23)F_c(x+\alpha d)-F_c(x)\ \le\ \sigma\alpha\Delta\qquad(23)Fc​(x+αd)−Fc​(x) ≤ σαΔ(23)

holds whenever 0≤α≤min⁡{1, 2λ‾(1−σ+σγ)/L}0\le\alpha\le\min\{1,\,2\underline\lambda(1-\sigma+\sigma\gamma)/L\}0≤α≤min{1,2λ​(1−σ+σγ)/L} (read as 0≤α≤10\le\alpha\le10≤α≤1 when L=0L=0L=0).

The lemma gives a stepsize, independent of xxx, at which the Armijo test (9) always passes; it is what makes the Armijo stepsizes bounded away from zero in Theorem 1(f).

Formalization Note The step range is stated as 0≤α≤10\le\alpha\le10≤α≤1 and αL≤2λ‾(1−σ+σγ)\alpha L\le2\underline\lambda(1-\sigma+\sigma\gamma)αL≤2λ​(1−σ+σγ), which is the paper's range for L>0L>0L>0 and [0,1][0,1][0,1] for L=0L=0L=0; the literal Lean min 1 (… / L) would be 000 at L=0L=0L=0. The conclusion includes x+αd∈dom⁡Px+\alpha d\in\operatorname{dom}Px+αd∈domP, so that both sides of (23) are finite. H⪰λ‾IH\succeq\underline\lambda IH⪰λ​I is stated as λ‾∥z∥2≤zTHz\underline\lambda\|z\|^2\le z^THzλ​∥z∥2≤zTHz for all zzz.

Preamble
import Mathlib
import Definitions.Def_TsengCGD_Linear_Basic
open Filter Topology Finset Matrix
open scoped RealInnerProductSpace
Formal statement
namespace TsengCGD.Linear

theorem lemma5_b {n : ℕ} (f : TsengCGD.Global.Vec n → ℝ) (D : Set (TsengCGD.Global.Vec n)) (P : TsengCGD.Global.Vec n → ℝ) (c : ℝ)
    (hs : TsengCGD.Global.Standing f D P c) (x : TsengCGD.Global.Vec n) (hx : x ∈ D) (H : Matrix (Fin n) (Fin n) ℝ)
    (hH : H.PosDef) (J : Finset (Fin n)) (hJ : J.Nonempty) (d : TsengCGD.Global.Vec n)
    (hd : TsengCGD.Global.IsDir f D P c H x J d) (γ : ℝ) (hγ0 : 0 ≤ γ) (hγ1 : γ < 1)
    (L : ℝ) (hL : GradLipOn f D L) (lam : ℝ) (hlam : 0 < lam)
    (hHlam : ∀ z : TsengCGD.Global.Vec n, lam * ‖z‖ ^ 2 ≤ TsengCGD.Global.qf H z)
    (σ : ℝ) (hσ0 : 0 < σ) (hσ1 : σ < 1)
    (α : ℝ) (hα0 : 0 ≤ α) (hα1 : α ≤ 1) (hαL : α * L ≤ 2 * lam * (1 - σ + σ * γ)) :
    x + α • d ∈ D ∧ TsengCGD.Global.Fc f P c (x + α • d) - TsengCGD.Global.Fc f P c x ≤ σ * α * TsengCGD.Global.Delta f P c γ H x d := by sorry

end TsengCGD.Linear
Source
Tseng and Yun, A coordinate gradient descent method for nonsmooth separable minimization, Math. Program. Ser. B 117 (2009), pp. 397–398, Lemma 5(b), (22), (23)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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