§2, p. 478, remark after (3) — bounded level set and lsc f: X⁰ is compact and each block minimization (2) is attained
ProvedTsengBCD.Hemivariate.argmin_attainedblock-coordinate-descentcompactnesslower-semicontinuousp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be lower semicontinuous and let be a point such that the level set
is bounded. Then is compact, and for every and every block the block minimization
is attained.
This is the remark that makes the BCD method well defined: every iterate stays in , so step (2) always has a minimizer.
Formalization Note. The page's " is lsc on " is read as lower semicontinuity of on the whole space, which Assumption B3 provides for . Lower semicontinuity of the restriction to alone would not make closed. The remark is general, so the statement is for an arbitrary .
Preamble
import Mathlib import Definitions.Def_TsengBCD_Hemivariate_Setting
Formal statement
namespace TsengBCD.Hemivariate
open Filter Topology
theorem argmin_attained {N : ℕ} {n : Fin N → ℕ} (f : TsengBCD.Stationary.X n → EReal) (x0 : TsengBCD.Stationary.X n)
(hbdd : Bornology.IsBounded (TsengBCD.Stationary.levelSet f x0)) (hlsc : LowerSemicontinuous f) :
IsCompact (TsengBCD.Stationary.levelSet f x0) ∧
∀ y ∈ TsengBCD.Stationary.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.Hemivariate
Source
Tseng, Convergence of a block coordinate descent method for nondifferentiable minimization, J. Optim. Theory Appl. 109 (2001), p. 478, §2, remark after (3)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.