§3.1, proof of Theorem 3.1, (8), p. 484 — for x* ∈ dom h, ∂_εh(x*) ⊂ ∂_εg(x*) ∀ε > 0 is condition (8)
ProvedTaoAnDCA.GlobalOpt.epsSubdiff_subset_iff_eq8conjugatedc-programmingepsilon-subdifferentialp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let satisfy the standing inclusions (3) and let . Then for every if and only if
The equivalence unfolds the definition of the -subdifferential through the conjugate: for , exactly when . It is the second step of the proof of Theorem 3.1(i).
Formalization Note The sums and are extended reals and may be ; the left-hand sides are real. The variable , free in the paper's (8), is quantified over all of . The standing assumptions are carried as hypotheses, though only is needed here.
Preamble
import Mathlib import Definitions.Def_TaoAnDCA_GlobalOpt_Setting open TaoAnDCA.GlobalOpt
Formal statement
namespace TaoAnDCA.GlobalOpt
theorem epsSubdiff_subset_iff_eq8 {n : ℕ} (g h : EuclideanSpace ℝ (Fin n) → EReal)
(hgh : DCStanding g h) (x : EuclideanSpace ℝ (Fin n)) (hx : x ∈ effDom h) :
(∀ ε : ℝ, 0 < ε → epsSubdiff h ε x ⊆ epsSubdiff g ε x) ↔
∀ ε : ℝ, 0 < ε → ∀ y : EuclideanSpace ℝ (Fin n),
((inner ℝ x y + ε : ℝ) : EReal) ≥ h x + CondatPD.FinDim.conj h y →
((inner ℝ x y + ε : ℝ) : EReal) ≥ g x + CondatPD.FinDim.conj g y := by sorry
end TaoAnDCA.GlobalOpt
Source
Pham Dinh & Le Thi, A d.c. optimization algorithm for solving the trust-region subproblem, SIAM J. Optim. 8 (1998), p. 484, §3.1, proof of Theorem 3.1, display (8)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.