Eq. (41) — the one-step KL estimate
ProvedNonconvexSplitting.ADMMKL.eq41_kl_stepadmmkurdyka-lojasiewicznonconvex-optimizationp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let , , , and be as in the paper, regarded on , and let be any sequences. Assume:
- constants with, for all , some with (the conclusion of (35)), and (the conclusion of (36));
- a real with for all ;
- , a set and satisfying condition (i) of Definition 1 on , such that the KL inequality (40) holds: for all with and all , .
Then for every with and ,
Summing this inequality telescopes the right-hand side and yields the finite length (34).
Formalization Note The paper states (41) for the ADMM sequence under " and ", which it uses only to conclude ; this statement assumes directly and takes (35), (36) and the case assumption as hypotheses, so it is implied by the paper's version. The range comes from applying (35) at index . Values of are in EReal; under the stated bounds the differences are finite reals and are converted with toReal.
Preamble
import Mathlib import Definitions.Def_NonconvexSplitting_Shared_IsProxADMMSeq import Definitions.Def_NonconvexSplitting_Shared_LimitingSubdiff import Definitions.Def_NonconvexSplitting_ADMMKL_AugLagProd import Definitions.Def_NonconvexSplitting_ADMMKL_KLProperty open NonconvexSplitting.Shared open Filter Topology open scoped InnerProductSpace
Formal statement
namespace NonconvexSplitting.ADMMKL
/-- Eq. (41) of Li–Pong (p. 15), in self-contained form. Let `(x^t, y^t, z^t)` be sequences and
`C, D > 0` constants satisfying the conclusions of (35) and (36) for `t ≥ 1`, let `l*` be a real
number with `L_β(x^t, y^t, z^t) > l*` for all `t ≥ 1`, and let `η > 0`, `V` and `φ` satisfy
condition (i) of Definition 1 and the KL inequality (40) at level `l*` on `V`. Then for every
`t ≥ 2` with `(x^t, y^t, z^t) ∈ V` and `l* < L_β(x^t, y^t, z^t) < l* + η`,
`‖x^{t+1} - x^t‖ + (‖x^{t+1} - x^t‖ - ‖x^t - x^{t-1}‖)
≤ (C/D) [φ(L_β(x^t, y^t, z^t) - l*) - φ(L_β(x^{t+1}, y^{t+1}, z^{t+1}) - l*)]`. -/
theorem eq41_kl_step {n m : ℕ} (h : EuclideanSpace ℝ (Fin n) → ℝ) (P : EuclideanSpace ℝ (Fin m) → EReal)
(M : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin m)) (β : ℝ)
(x : ℕ → EuclideanSpace ℝ (Fin n)) (y z : ℕ → EuclideanSpace ℝ (Fin m))
(C D : ℝ) (hC : 0 < C) (hD : 0 < D)
(h35 : ∀ t : ℕ, 1 ≤ t →
∃ w ∈ LimitingSubdiff (augLagX h P M β) (pack (x (t + 1)) (y (t + 1)) (z (t + 1))),
‖w‖ ≤ C * ‖x (t + 1) - x t‖)
(h36 : ∀ t : ℕ, 1 ≤ t →
augLag h P M β (x (t + 1)) (y (t + 1)) (z (t + 1)) + ((D * ‖x (t + 1) - x t‖ ^ 2 : ℝ) : EReal) ≤
augLag h P M β (x t) (y t) (z t))
(lstar : ℝ) (hgt : ∀ t : ℕ, 1 ≤ t → (lstar : EReal) < augLag h P M β (x t) (y t) (z t))
(η : ℝ) (hη : 0 < η) (V : Set (XYZ n m)) (φ : ℝ → ℝ) (hφ : IsDesingularizer η φ)
(h40 : ∀ w ∈ V, (lstar : EReal) < augLagX h P M β w →
augLagX h P M β w < (lstar : EReal) + (η : EReal) →
∀ v ∈ LimitingSubdiff (augLagX h P M β) w,
1 ≤ deriv φ (augLagX h P M β w - (lstar : EReal)).toReal * ‖v‖)
(t : ℕ) (ht : 2 ≤ t) (hV : pack (x t) (y t) (z t) ∈ V)
(hlo : (lstar : EReal) < augLag h P M β (x t) (y t) (z t))
(hhi : augLag h P M β (x t) (y t) (z t) < (lstar : EReal) + (η : EReal)) :
‖x (t + 1) - x t‖ + (‖x (t + 1) - x t‖ - ‖x t - x (t - 1)‖) ≤
C / D * (φ (augLag h P M β (x t) (y t) (z t) - (lstar : EReal)).toReal -
φ (augLag h P M β (x (t + 1)) (y (t + 1)) (z (t + 1)) - (lstar : EReal)).toReal) := by sorry
end NonconvexSplitting.ADMMKL
Source
Li & Pong, Global Convergence of Splitting Methods for Nonconvex Composite Optimization, arXiv:1407.0753v6, p. 15, Eq. (41) and the display after it
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.