Theorem 3.5 — for and , converges weakly to a minimizer of
ProvedTikhonovHDD.Weak.theorem_3_5Let be a real Hilbert space, , , and . Let be convex and twice Fréchet differentiable, with gradient Lipschitz continuous on bounded sets and , and let be nonincreasing, of class , with (the General assumption). Let be a global -solution of
Assume that and that one of the following conditions holds:
- (a) there exist and such that for every ;
- (b) there exist and such that for every .
Write for the minimal value of .
If , then converges weakly, as , to an element of : there is with
This is the main result of Section 3: adding a Tikhonov regularization term with to the inertial system with Hessian-driven damping preserves the weak convergence of its trajectories to minimizers known for .
Formalization Note The solution is a map with velocity and acceleration maps ; derivatives are one-sided (within ) at , is continuous on , and values before are irrelevant. The statement is made for every -solution; existence and uniqueness is Theorem 2.1. is the Fréchet derivative of at applied to ; is a derivative map tied to by one-sided derivatives on . is , attained because . Integrability is Lebesgue integrability on (IntegrableOn), and , are taken as . Weak convergence is stated through inner products against every ; it is not norm convergence.
import Mathlib import Definitions.Def_TikhonovHDD_Weak_Setting open Filter Topology Set MeasureTheory Asymptotics
namespace TikhonovHDD.Weak
theorem theorem_3_5
{H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
(g : H → ℝ) (ε ε' : ℝ → ℝ) (α β t₀ : ℝ) (u₀ v₀ : H) (x xd xdd : ℝ → H)
(ht₀ : 0 < t₀) (hβ : 0 ≤ β) (hg : GenAssumptionG g) (hε : GenAssumptionEps t₀ ε ε')
(hsol : IsSolution g ε α β t₀ u₀ v₀ x xd xdd)
(hint : IntegrableOn (fun t => t * ε t) (Ici t₀))
(hab : CondA β t₀ ε ε' ∨ CondB t₀ ε)
(hα : 3 < α) :
∃ xbar ∈ argmin g, WeakTendstoAtTop x xbar := by sorry
end TikhonovHDD.Weak
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.