Proof of Theorem 4.1, p. 481 — on a compact level set where f is continuous, each block minimization (2) is attained
ProvedTsengBCD.Stationary.argmin_attainedattainmentblock-coordinate-descentlevel-setp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let never take the value , let , assume is compact and is continuous at every point of . Then for every and every block there is with
This is the statement " is defined" in the induction of the proof of Theorem 4.1: whichever block is chosen, the minimization (2) has a solution, so the BCD method can always proceed.
Formalization Note. "f is continuous on " is formalized as continuity of , as a map into , at every point of (see the goal theorem for why); for this step continuity of the restriction to would already suffice.
Preamble
import Mathlib import Definitions.Def_TsengBCD_Stationary_Setting
Formal statement
namespace TsengBCD.Stationary
open Filter Topology
theorem argmin_attained {N : ℕ} {n : Fin N → ℕ} (f : X n → EReal) (hbot : ∀ x, f x ≠ ⊥)
(x0 : X n) (hx0 : f x0 ≠ ⊤) (hcpt : IsCompact (levelSet f x0))
(hcont : ∀ y ∈ levelSet f x0, ContinuousAt f y) :
∀ y ∈ levelSet f x0, ∀ k : Fin N, ∃ a : EuclideanSpace ℝ (Fin (n k)),
∀ b : EuclideanSpace ℝ (Fin (n k)),
f (Function.update y k a) ≤ f (Function.update y k b) := by sorry
end TsengBCD.Stationary
Source
Tseng, Convergence of a block coordinate descent method for nondifferentiable minimization, J. Optim. Theory Appl. 109 (2001), p. 481, proof of Theorem 4.1, first sentence ("x^{r+1} is defined")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.