Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2 after (10) — negative descent quantity and Armijo trial existence

Proved
TsengCGD.Global.armijo_exists

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

composite-optimizationcoordinate-descentnonsmooth-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Under the standing assumptions, take x∈dom⁡Px\in\operatorname{dom}Px∈domP, a nonempty block J\mathcal JJ, a positive-definite matrix HHH, and the exact direction ddd. Let 0<β,σ<10<\beta,\sigma<10<β,σ<1, 0≤γ<10\le\gamma<10≤γ<1, and let a0>0a_0>0a0​>0 be an initial trial step. With Δ=∇f(x)⊤d+γd⊤Hd+cP(x+d)−cP(x)\Delta=\nabla f(x)^\top d+\gamma d^\top Hd+cP(x+d)-cP(x)Δ=∇f(x)⊤d+γd⊤Hd+cP(x+d)−cP(x), the paper's claim after (10) includes

Fc(x+αd)≤Fc(x)+αΔ+o(α),Δ≤(γ−1)d⊤Hd<0if d≠0.F_c(x+\alpha d)\le F_c(x)+\alpha\Delta+o(\alpha),\qquad \Delta\le(\gamma-1)d^\top Hd<0\quad\text{if }d\ne0.Fc​(x+αd)≤Fc​(x)+αΔ+o(α),Δ≤(γ−1)d⊤Hd<0if d=0.

There is some j≥0j\ge0j≥0 for which a0βja_0\beta^ja0​βj passes the Armijo test. This establishes that the backtracking rule has a positive accepted trial, including when d=0d=0d=0.

Formalization Note The little-ooo remainder is explicit and the tested point must belong to DDD. The strict inequality is conditional on d≠0d\ne0d=0; at d=0d=0d=0 a trial still exists.

Preamble
import Mathlib
import Definitions.Def_TsengCGD_Global_Basic
Formal statement
namespace TsengCGD.Global

open Filter Topology Finset Matrix
open scoped RealInnerProductSpace

theorem armijo_exists {n : ℕ} (f : Vec n → ℝ) (D : Set (Vec n)) (P : Vec n → ℝ)
    (c : ℝ) (hs : Standing f D P c)
    (x : Vec n) (hx : x ∈ D) (J : Finset (Fin n)) (hJ : J.Nonempty)
    (H : Matrix (Fin n) (Fin n) ℝ) (hH : H.PosDef)
    (d : Vec n) (hd : IsDir f D P c H x J d)
    (β σ γ a₀ : ℝ) (hparams : ArmijoParams β σ γ) (ha₀ : 0 < a₀) :
    (∃ r : ℝ → ℝ, Tendsto (fun a => r a / a) (𝓝[>] (0 : ℝ)) (𝓝 0) ∧
      ∀ a ∈ Set.Ioc (0 : ℝ) 1,
        x + a • d ∈ D ∧
        Fc f P c (x + a • d) ≤ Fc f P c x + a * Delta f P c γ H x d + r a) ∧
    Delta f P c γ H x d ≤ (γ - 1) * qf H d ∧
    (d ≠ 0 → Delta f P c γ H x d < 0) ∧
    ∃ j : ℕ, ArmijoTest f D P c σ γ H x d (a₀ * β ^ j) := by sorry

end TsengCGD.Global
Source
Tseng and Yun, A coordinate gradient descent method for nonsmooth separable minimization, Math. Program. Ser. B 117 (2009), p. 392, §2, claim after equation (10), https://doi.org/10.1007/s10107-007-0170-0
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