(22), p. 12 — block minimality of z gives u′_k(x_k, z; d_k)|_{x_k=z_k} ≥ 0 for feasible d_k
ProvedBSUMConv.BSUM.eq_22directional-derivativeoptimality-conditionsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1successive-upper-bound-minimization
Let with each convex, let be real functions, and let satisfy for all and every block . Then
where is the directional derivative in the variable only.
Combined with (B3), this turns block minimality of the surrogate into coordinatewise stationarity of .
Formalization Note The directional derivative is extended-real valued (a liminf), as in the referenced setting.
Preamble
import Mathlib import Definitions.Def_TsengBCD_Stationary_Setting import Definitions.Def_BSUMConv_BSUM_Setting
Formal statement
namespace BSUMConv.BSUM
open TsengBCD.Stationary Filter Topology
/-- (22), p. 12: if `z ∈ X` and `z_k` minimises `u_k(·, z)` over `X_k` for every block `k`,
then `u′_k(x_k, z; d_k)|_{x_k = z_k} ≥ 0` for every `d_k` with `z_k + d_k ∈ X_k`. -/
theorem eq_22 {N : ℕ} {n : Fin N → ℕ}
(Xs : (i : Fin N) → Set (EuclideanSpace ℝ (Fin (n i))))
(hXconv : ∀ i, Convex ℝ (Xs i))
(u : (i : Fin N) → EuclideanSpace ℝ (Fin (n i)) → X n → ℝ)
(z : X n) (hzX : z ∈ Xset Xs) (hmin : ∀ (k : Fin N), ∀ w ∈ Xs k, u k (z k) z ≤ u k w z) :
∀ (k : Fin N) (dk : EuclideanSpace ℝ (Fin (n k))), z k + dk ∈ Xs k →
0 ≤ dirDeriv (fun xk => (u k xk z : EReal)) (z k) dk := by sorry
end BSUMConv.BSUM
Source
Razaviyayn, Hong & Luo, arXiv:1209.2385v1, p. 12, proof of Theorem 2(a), display (22)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.