Summed decrease bound after (46)
ProvedNonconvexSplitting.ProxGrad.summed_decreasenonconvex-optimizationp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-gradient
Under the hypotheses of (46) (standing assumptions on and ; convex and ; with ; ; generated by (43)), for every with ,
Equivalently, where is finite (which is the case for , as minimizes a proper function), , the form printed in the paper.
Formalization Note The additive form avoids the undefined difference in EReal. The range is the paper's "any ".
Preamble
import Mathlib import Definitions.Def_NonconvexSplitting_ProxGrad_StandingAssumptions import Definitions.Def_NonconvexSplitting_ProxGrad_HessianSandwich import Definitions.Def_NonconvexSplitting_ProxGrad_IsProxGradSeq
Formal statement
namespace NonconvexSplitting.ProxGrad
/-- The display after (46) in Li–Pong (p. 18), in additive form: for `N - 1 > 0`,
`(1/(2β) - ℓ/2) Σ_{t=0}^{N-1} ‖x^{t+1} - x^t‖² + h(x^N) + P(x^N) ≤ h(x^0) + P(x^0)`, in `EReal`. -/
theorem summed_decrease {n : ℕ} (h q : EuclideanSpace ℝ (Fin n) → ℝ) (P : EuclideanSpace ℝ (Fin n) → EReal) (ℓ β : ℝ)
(x : ℕ → EuclideanSpace ℝ (Fin n))
(hSA : StandingAssumptions h P) (hq : ContDiff ℝ 2 q) (hq_convex : ConvexOn ℝ Set.univ q)
(hℓ : 0 < ℓ) (h44 : HessianSandwich h q ℓ) (hβ : 0 < β)
(hx : IsProxGradSeq h P β x) (N : ℕ) (hN : 1 < N) :
(((1 / (2 * β) - ℓ / 2) * ∑ t ∈ Finset.range N, ‖x (t + 1) - x t‖ ^ 2 : ℝ) : EReal) +
((h (x N) : ℝ) : EReal) + P (x N) ≤
((h (x 0) : ℝ) : EReal) + P (x 0) := by sorry
end NonconvexSplitting.ProxGrad
Source
Li & Pong, Global Convergence of Splitting Methods for Nonconvex Composite Optimization, arXiv:1407.0753v6, p. 18, display after Eq. (46)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.