Theorem 1(e) — every cluster point is stationary under generalized Gauss–Seidel selection
DisprovedTsengCGD.Global.theorem1_eConsider a CGD run for under Assumption 1. The steps use the Armijo rule with . Suppose every consecutive coordinate sets cover all coordinates, is block-separable with respect to each chosen set , and . Then
Thus every accumulation point satisfies the full directional first-order condition, despite the changing coordinate blocks and nonsmooth penalty.
Formalization Note The standing assumptions of (1), exact subproblem minimizers, first accepted Armijo trial, and the ranges of all line-search parameters are explicit. MapClusterPt encodes a cluster point without assuming the full run converges. Stationarity covers all directions, not only the current block. The upper bound on accepted steps is a finite real bound.
import Mathlib import Definitions.Def_TsengCGD_Global_Basic
namespace TsengCGD.Global
open Filter Topology Finset Matrix
open scoped RealInnerProductSpace
theorem theorem1_e {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)
(hGS : GaussSeidel J) (hsep : ∀ k, BlockSeparable D P (J k))
(hsup : ∃ A : ℝ, ∀ k, α k ≤ A) :
∀ xbar : Vec n, MapClusterPt xbar atTop x → IsStationary f D P c xbar := by sorry
end TsengCGD.Global
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.