Lemma 6 — ‖(d̃, δ̃)‖ ≤ κ‖d_I(x)‖ for P Lipschitz on dom P, κ depending only on the Lipschitz constant
ProvedTsengCGD.ErrorBound.lemma6Assume the standing assumptions of problem (1): , proper convex lower semicontinuous, continuously differentiable on an open set containing . Let be the residual (13) and, for , let be an optimal solution of the subproblem
For every there is a scalar , depending only on , such that whenever is Lipschitz continuous on with constant , then for every
The lemma compares the residual of the reformulation (41), a smooth problem over , with the residual of the original problem; it is what lets error bounds known for constrained smooth problems be transferred to (1).
Formalization Note is quantified before the dimension and the data , so it is a function of alone, as the paper says. The bound is asserted for every optimal solution of (42) (predicate IsEpiSubSol); the paper notes the solution is unique. .
import Mathlib import Definitions.Def_TsengCGD_Linear_Basic import Definitions.Def_TsengCGD_ErrorBound_Conditions
namespace TsengCGD.ErrorBound
theorem lemma6 :
∀ K : ℝ, 0 ≤ K → ∃ κ > 0, ∀ {n : ℕ} (f : TsengCGD.Global.Vec n → ℝ) (D : Set (TsengCGD.Global.Vec n)) (P : TsengCGD.Global.Vec n → ℝ) (c : ℝ),
TsengCGD.Global.Standing f D P c → PLipOn D P K →
∀ x ∈ D, ∀ (dt : TsengCGD.Global.Vec n) (δt : ℝ), IsEpiSubSol f D P c x (P x) dt δt →
pairNorm dt δt ≤ κ * ‖TsengCGD.Global.dI f D P c x‖ := by sorry
end TsengCGD.ErrorBound
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.