Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1(a) — monotone objective and quantitative descent

Proved
TsengCGD.Global.theorem1_a

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

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

Consider a CGD run for FcF_cFc​ under Assumption 1, with Armijo steps and initial trial steps bounded below by a positive constant. If λ‾>0\underline\lambda>0λ​>0 is the uniform lower matrix bound and Δk\Delta^kΔk is defined by (10), then every iterate remains in the effective domain, Fc(xk)F_c(x^k)Fc​(xk) is nonincreasing, and for each kkk,

−Δk≥(1−γ)(dk)⊤Hkdk≥(1−γ)λ‾∥dk∥2,-\Delta^k\ge(1-\gamma)(d^k)^\top H^kd^k \ge(1-\gamma)\underline\lambda\|d^k\|^2,−Δk≥(1−γ)(dk)⊤Hkdk≥(1−γ)λ​∥dk∥2, Fc(xk+1)−Fc(xk)≤σαkΔk≤0.F_c(x^{k+1})-F_c(x^k)\le\sigma\alpha^k\Delta^k\le0.Fc​(xk+1)−Fc​(xk)≤σαkΔk≤0.

These are the descent estimates used in the subsequent global-convergence claims.

Formalization Note The CGD run uses exact minimizers, and Armijo chooses the first accepted exponent. The whole preamble of Theorem 1, including the positive lower bound on initial trial steps, is retained. Domain membership is explicit because FcF_cFc​ is finite only on DDD.

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

open Filter Topology Finset Matrix
open scoped RealInnerProductSpace

theorem theorem1_a {n : ℕ} (f : Vec n → ℝ) (D : Set (Vec n)) (P : Vec n → ℝ)
    (c : ℝ) (hs : Standing f D P c)
    (J : ℕ → Finset (Fin n)) (H : ℕ → Matrix (Fin n) (Fin n) ℝ)
    (x d : ℕ → Vec n) (α αinit : ℕ → ℝ) (β σ γ lam lamBar : ℝ)
    (hrun : IsCGDRun f D P c J H x d α)
    (harm : IsArmijo f D P c β σ γ αinit H x d α)
    (hA1 : Assumption1 H lam lamBar)
    (hinit : ∃ a : ℝ, 0 < a ∧ ∀ k, a ≤ αinit k) :
    let Δ := fun k => Delta f P c γ (H k) (x k) (d k)
    Antitone (fun k => Fc f P c (x k)) ∧
    (∀ k, x k ∈ D) ∧
    (∀ k, (1 - γ) * qf (H k) (d k) ≤ -Δ k ∧
      (1 - γ) * lam * ‖d k‖ ^ 2 ≤ (1 - γ) * qf (H k) (d k)) ∧
    (∀ k, Fc f P c (x (k + 1)) - Fc f P c (x k) ≤ σ * α k * Δ k ∧
      σ * α k * Δ k ≤ 0) := 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. 399, Theorem 1(a), equations (26)–(27), 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