§3.1, proof of Theorem 3.1, p. 484 — for x* ∈ dom h, (x* ∈ dom g and (7)) is equivalent to (8)
ProvedTaoAnDCA.GlobalOpt.eq7_iff_eq8conjugatedc-programmingglobal-optimalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let satisfy the standing inclusions (3) and let . Then the following are equivalent:
- and
- for every and every ,
The paper calls this equivalence easy to see; combined with the two previous steps it proves Theorem 3.1(i).
Formalization Note Sums are extended reals. The clause accompanies (7) as in the paper's " if and only if and (6)". When both sides are false: the first by the domain clause, the second because is nonempty for while .
Preamble
import Mathlib import Definitions.Def_TaoAnDCA_GlobalOpt_Setting open TaoAnDCA.GlobalOpt
Formal statement
namespace TaoAnDCA.GlobalOpt
theorem eq7_iff_eq8 {n : ℕ} (g h : EuclideanSpace ℝ (Fin n) → EReal)
(hgh : DCStanding g h) (x : EuclideanSpace ℝ (Fin n)) (hx : x ∈ effDom h) :
(x ∈ effDom g ∧ ∀ y ∈ effDom (CondatPD.FinDim.conj h),
g x + CondatPD.FinDim.conj g y ≤ h x + CondatPD.FinDim.conj h y) ↔
∀ ε : ℝ, 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: "It is easy to see the equivalence between (7) and (8)"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.