Proof of Theorem 4, p. 13 — E_{k+1} − E_k + h(h/2·C_k² + δ_kβ_{k+1})‖∇f(x_{k+1})‖² ≤ 0
ProvedHessianDamping.IPAHD.EK_succ_sub_add_lehessian-dampinginertial-algorithmlyapunovp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a real Hilbert space and a convex function with a minimizer . Let , , , let , be non-negative sequences, and let be generated by (IPAHD). If and both growth conditions hold at , and , then
where is (9) and the energy of the proof of Theorem 4.
Summing these inequalities over gives Theorem 4 (ii).
Formalization Note. The page sums the inequalities over all for which the growth conditions hold; here the per-step inequality is stated at a single with the growth conditions at that . is a point with for all ; , are implicit on the page and added.
Preamble
import Mathlib import Definitions.Def_GoldenRatioVI_Shared_IsProxPoint import Definitions.Def_HessianDamping_IPAHD_Setting
Formal statement
namespace HessianDamping.IPAHD
/-- Proof of Theorem 4, p. 13: the inequality that is summed to obtain (ii), under (G₂dis)
and (G₃dis) at `k`. -/
theorem EK_succ_sub_add_le
{H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
(f : H → ℝ) (hfconv : ConvexOn ℝ Set.univ f) (hfC1 : ContDiff ℝ 1 f)
(xstar : H) (hxstar : ∀ y, f xstar ≤ f y)
(α : ℝ) (hα : 1 ≤ α)
(h s : ℝ) (hh : 0 < h) (hs : s = h ^ 2)
(β b : ℕ → ℝ) (hβ : ∀ k, 0 ≤ β k) (hb : ∀ k, 0 ≤ b k)
(x : ℕ → H) (hx : IsIPAHDRun f α s β b x)
(k : ℕ) (hk : 1 ≤ k)
(hG2 : 0 < b k * h * k - β (k + 1) - k * (β (k + 1) - β k))
(hG3 : deltaK h β b (k + 1) - deltaK h β b k ≤ (α - 1) * deltaK h β b k / ((k : ℝ) + 1)) :
EK f α h β b x xstar (k + 1) - EK f α h β b x xstar k
+ h * (h / 2 * CK h β b k ^ 2 + deltaK h β b k * β (k + 1))
* ‖gradient f (x (k + 1))‖ ^ 2 ≤ 0 := by sorry
end HessianDamping.IPAHD
Source
Attouch, Chbani, Fadili, Riahi, First-order optimization algorithms via inertial systems with Hessian driven damping, arXiv:1907.10536v2, §3.1.1, proof of Theorem 4, p. 13
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.